/usr/lib/jvm/java-1.11.0-openjdk-amd64/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/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 05:11:04,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 05:11:04,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-01-26 05:11:04,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 05:11:04,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 05:11:04,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 05:11:04,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 05:11:04,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 05:11:04,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 05:11:04,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 05:11:04,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 05:11:04,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 05:11:04,486 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 05:11:04,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 05:11:04,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 05:11:04,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 05:11:04,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 05:11:04,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 05:11:04,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 05:11:04,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 05:11:04,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 05:11:04,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 05:11:04,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 05:11:04,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 05:11:04,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 05:11:04,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 05:11:04,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 05:11:04,490 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 05:11:04,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 05:11:04,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:11:04,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 05:11:04,491 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 05:11:04,492 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-01-26 05:11:04,492 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-01-26 05:11:04,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 05:11:04,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 05:11:04,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 05:11:04,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 05:11:04,699 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 05:11:04,700 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-01-26 05:11:05,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 05:11:05,946 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 05:11:05,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-01-26 05:11:05,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/21cc92ca8/2b83f34418cd4c0694a6b697a8b8c040/FLAG014d34951 [2024-01-26 05:11:05,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/21cc92ca8/2b83f34418cd4c0694a6b697a8b8c040 [2024-01-26 05:11:05,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 05:11:05,970 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 05:11:05,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 05:11:05,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 05:11:05,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 05:11:05,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:11:05" (1/1) ... [2024-01-26 05:11:05,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774e694f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:05, skipping insertion in model container [2024-01-26 05:11:05,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 05:11:05" (1/1) ... [2024-01-26 05:11:05,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 05:11:06,119 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[2454,2467] [2024-01-26 05:11:06,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:11:06,138 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 05:11:06,152 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[2454,2467] [2024-01-26 05:11:06,155 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 05:11:06,165 INFO L206 MainTranslator]: Completed translation [2024-01-26 05:11:06,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06 WrapperNode [2024-01-26 05:11:06,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 05:11:06,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 05:11:06,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 05:11:06,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 05:11:06,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,215 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2024-01-26 05:11:06,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 05:11:06,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 05:11:06,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 05:11:06,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 05:11:06,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 05:11:06,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 05:11:06,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 05:11:06,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 05:11:06,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (1/1) ... [2024-01-26 05:11:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 05:11:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:06,305 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-01-26 05:11:06,328 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-01-26 05:11:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 05:11:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 05:11:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 05:11:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 05:11:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 05:11:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 05:11:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 05:11:06,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 05:11:06,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 05:11:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 05:11:06,353 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 05:11:06,448 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 05:11:06,450 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 05:11:06,716 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 05:11:06,801 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 05:11:06,802 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 05:11:06,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:11:06 BoogieIcfgContainer [2024-01-26 05:11:06,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 05:11:06,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 05:11:06,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 05:11:06,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 05:11:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 05:11:05" (1/3) ... [2024-01-26 05:11:06,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11da3625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:11:06, skipping insertion in model container [2024-01-26 05:11:06,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 05:11:06" (2/3) ... [2024-01-26 05:11:06,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11da3625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 05:11:06, skipping insertion in model container [2024-01-26 05:11:06,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 05:11:06" (3/3) ... [2024-01-26 05:11:06,808 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-01-26 05:11:06,815 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 05:11:06,822 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 05:11:06,822 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 05:11:06,822 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 05:11:06,869 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 05:11:06,924 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:11:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 05:11:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:06,927 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-01-26 05:11:06,949 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-01-26 05:11:06,979 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 05:11:06,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 05:11:06,990 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;@21f7eefa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 05:11:06,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-26 05:11:07,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:07,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash 649439088, now seen corresponding path program 1 times [2024-01-26 05:11:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374332955] [2024-01-26 05:11:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-26 05:11:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374332955] [2024-01-26 05:11:07,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374332955] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:11:07,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:11:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 05:11:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098125723] [2024-01-26 05:11:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:11:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 05:11:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 05:11:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 05:11:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:07,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 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-01-26 05:11:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 05:11:07,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:07,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -478654248, now seen corresponding path program 1 times [2024-01-26 05:11:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574650421] [2024-01-26 05:11:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:11:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574650421] [2024-01-26 05:11:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574650421] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 05:11:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 05:11:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-26 05:11:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668815531] [2024-01-26 05:11:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 05:11:07,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 05:11:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 05:11:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-26 05:11:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:07,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-01-26 05:11:07,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:07,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 05:11:07,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:07,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1101290333, now seen corresponding path program 1 times [2024-01-26 05:11:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521582065] [2024-01-26 05:11:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:11:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521582065] [2024-01-26 05:11:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521582065] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:11:08,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218816467] [2024-01-26 05:11:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:08,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:11:08,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:08,208 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-01-26 05:11:08,210 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-01-26 05:11:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:08,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 05:11:08,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:11:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:11:08,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:11:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 05:11:08,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218816467] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:11:08,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:11:08,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-01-26 05:11:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625863447] [2024-01-26 05:11:08,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:11:08,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 05:11:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 05:11:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-01-26 05:11:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:08,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:08,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 states have internal predecessors, (169), 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-01-26 05:11:08,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:08,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:08,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:09,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-26 05:11:09,245 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-01-26 05:11:09,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:09,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1739854050, now seen corresponding path program 2 times [2024-01-26 05:11:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236615590] [2024-01-26 05:11:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 05:11:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236615590] [2024-01-26 05:11:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236615590] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:11:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85536165] [2024-01-26 05:11:09,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 05:11:09,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:11:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:09,447 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-01-26 05:11:09,449 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-01-26 05:11:09,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 05:11:09,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:11:09,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 05:11:09,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:11:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:11:09,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:11:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-26 05:11:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85536165] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:11:09,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:11:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-01-26 05:11:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316884644] [2024-01-26 05:11:09,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:11:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-26 05:11:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-26 05:11:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-01-26 05:11:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:09,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:09,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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-01-26 05:11:09,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:09,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:09,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:09,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 05:11:10,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-26 05:11:10,283 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-01-26 05:11:10,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:10,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1075289918, now seen corresponding path program 3 times [2024-01-26 05:11:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515975809] [2024-01-26 05:11:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 05:11:10,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:10,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515975809] [2024-01-26 05:11:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515975809] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:11:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886898191] [2024-01-26 05:11:10,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 05:11:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:11:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:10,512 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-01-26 05:11:10,543 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-01-26 05:11:10,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-26 05:11:10,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:11:10,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 05:11:10,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:11:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 05:11:10,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:11:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 05:11:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886898191] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:11:11,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:11:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2024-01-26 05:11:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456749518] [2024-01-26 05:11:11,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:11:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-01-26 05:11:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-01-26 05:11:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2024-01-26 05:11:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:11,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:11,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 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-01-26 05:11:11,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:11,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:11,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:11,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 05:11:11,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 05:11:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 05:11:11,551 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-01-26 05:11:11,740 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-01-26 05:11:11,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:11,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -108846649, now seen corresponding path program 4 times [2024-01-26 05:11:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:11,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044226570] [2024-01-26 05:11:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 05:11:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:11:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 05:11:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044226570] [2024-01-26 05:11:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044226570] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 05:11:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572100611] [2024-01-26 05:11:11,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 05:11:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 05:11:11,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 05:11:11,991 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-01-26 05:11:12,041 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-01-26 05:11:12,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 05:11:12,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 05:11:12,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 05:11:12,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 05:11:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:11:12,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 05:11:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 05:11:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572100611] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 05:11:12,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 05:11:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2024-01-26 05:11:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177458475] [2024-01-26 05:11:12,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 05:11:12,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-01-26 05:11:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 05:11:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-01-26 05:11:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-01-26 05:11:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:12,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 05:11:12,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 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-01-26 05:11:12,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:12,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:12,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:12,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 05:11:12,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-01-26 05:11:12,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 05:11:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 05:11:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 05:11:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 05:11:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-26 05:11:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 05:11:13,119 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-01-26 05:11:13,306 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-01-26 05:11:13,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 05:11:13,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 05:11:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1568602081, now seen corresponding path program 5 times [2024-01-26 05:11:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 05:11:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597606751] [2024-01-26 05:11:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 05:11:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 05:11:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 05:11:13,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 05:11:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 05:11:13,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 05:11:13,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 05:11:13,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 05:11:13,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 05:11:13,504 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-01-26 05:11:13,506 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2024-01-26 05:11:13,509 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 05:11:13,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 05:11:13,611 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:11:13,614 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:11:13,616 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 05:11:13,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 05:11:13 BasicIcfg [2024-01-26 05:11:13,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 05:11:13,626 INFO L158 Benchmark]: Toolchain (without parser) took 7656.13ms. Allocated memory was 221.2MB in the beginning and 415.2MB in the end (delta: 194.0MB). Free memory was 156.7MB in the beginning and 353.3MB in the end (delta: -196.6MB). Peak memory consumption was 151.4MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,626 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory was 169.3MB in the beginning and 169.2MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 05:11:13,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.95ms. Allocated memory is still 221.2MB. Free memory was 156.5MB in the beginning and 144.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.51ms. Allocated memory is still 221.2MB. Free memory was 144.2MB in the beginning and 142.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,627 INFO L158 Benchmark]: Boogie Preprocessor took 37.62ms. Allocated memory is still 221.2MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,627 INFO L158 Benchmark]: RCFGBuilder took 548.33ms. Allocated memory was 221.2MB in the beginning and 326.1MB in the end (delta: 104.9MB). Free memory was 140.6MB in the beginning and 274.3MB in the end (delta: -133.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,627 INFO L158 Benchmark]: TraceAbstraction took 6821.84ms. Allocated memory was 326.1MB in the beginning and 415.2MB in the end (delta: 89.1MB). Free memory was 273.3MB in the beginning and 353.3MB in the end (delta: -80.0MB). Peak memory consumption was 162.2MB. Max. memory is 8.0GB. [2024-01-26 05:11:13,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory was 169.3MB in the beginning and 169.2MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.95ms. Allocated memory is still 221.2MB. Free memory was 156.5MB in the beginning and 144.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.51ms. Allocated memory is still 221.2MB. Free memory was 144.2MB in the beginning and 142.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.62ms. Allocated memory is still 221.2MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.33ms. Allocated memory was 221.2MB in the beginning and 326.1MB in the end (delta: 104.9MB). Free memory was 140.6MB in the beginning and 274.3MB in the end (delta: -133.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6821.84ms. Allocated memory was 326.1MB in the beginning and 415.2MB in the end (delta: 89.1MB). Free memory was 273.3MB in the beginning and 353.3MB in the end (delta: -80.0MB). Peak memory consumption was 162.2MB. 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: 765, independent: 634, independent conditional: 634, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 655, independent: 634, independent conditional: 634, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 655, independent: 634, independent conditional: 634, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 718, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 84, dependent conditional: 63, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 718, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 84, dependent conditional: 4, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 718, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 84, dependent conditional: 4, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 62, dependent conditional: 7, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 718, independent: 558, independent conditional: 0, independent unconditional: 558, dependent: 79, dependent conditional: 2, dependent unconditional: 77, unknown: 81, unknown conditional: 2, unknown unconditional: 79] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 5, Negative conditional cache size: 2, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 59, Maximal queried relation: 6, Independence queries for same thread: 110 - 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, _argptr={0:0}, _argptr={0:0}, 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, _argptr={0:0}, _argptr={0:0}, counter=7, i=0, tmp=7] [L49] 1 i++ VAL [A={3:0}, N=3, _argptr={0:0}, _argptr={0:0}, counter=7, i=1, tmp=7] [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, _argptr={0:0}, _argptr={0:0}, counter=7, 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, _argptr={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L49] 1 i++ VAL [A={3:0}, N=3, _argptr={0:0}, _argptr={0:0}, counter=0, i=2, tmp=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, _argptr={0:0}, _argptr={0:0}, counter=-2, i=2, tmp=-2] [L49] 1 i++ VAL [A={3:0}, N=3, _argptr={0:0}, _argptr={0:0}, counter=-2, i=3, tmp=-2] [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, _argptr={0:0}, _argptr={0:0}, counter=5, i=1, tmp=5] [L62] 2 i++ VAL [A={3:0}, N=3, _argptr={0:0}, _argptr={0:0}, counter=5, i=2, tmp=5] [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, _argptr={0:0}, _argptr={0:0}, counter=7, i=2, tmp=7] [L62] 2 i++ VAL [A={3:0}, N=3, _argptr={0:0}, _argptr={0:0}, counter=7, i=3, tmp=7] [L62] COND FALSE 2 !(i