/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/array-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:24,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:24,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:24,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:24,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:24,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:24,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:24,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:24,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:24,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:24,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:24,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:24,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:24,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:24,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:24,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:24,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:24,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:24,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:24,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:24,257 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:24,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:24,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:24,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:24,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:24,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:24,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:24,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:24,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:24,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:24,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:24,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:24,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:24,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:24,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:24,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:24,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:24,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:24,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:24,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:24,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:24,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:24,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:24,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:24,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:24,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:24,290 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:24,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:24,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:24,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:24,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:24,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:24,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:24,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:24,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:24,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:24,294 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:24,294 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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/UAutomizer-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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:24,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:24,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:24,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:24,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:24,561 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:24,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-2.c [2022-04-28 02:41:24,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4086ca9e/1dd86a27dc5b4a8084e7ed48d025c9b5/FLAG7d9675b2c [2022-04-28 02:41:25,035 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:25,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c [2022-04-28 02:41:25,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4086ca9e/1dd86a27dc5b4a8084e7ed48d025c9b5/FLAG7d9675b2c [2022-04-28 02:41:25,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4086ca9e/1dd86a27dc5b4a8084e7ed48d025c9b5 [2022-04-28 02:41:25,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:25,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:25,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:25,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:25,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:25,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645077bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25, skipping insertion in model container [2022-04-28 02:41:25,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:25,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:25,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c[319,332] [2022-04-28 02:41:25,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:25,636 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:25,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/array-2.c[319,332] [2022-04-28 02:41:25,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:25,664 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:25,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25 WrapperNode [2022-04-28 02:41:25,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:25,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:25,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:25,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:25,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:25,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:25,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:25,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:25,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:25,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:25,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:41:25,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:41:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:25,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:25,772 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:25,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:25,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:41:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:41:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:25,837 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:25,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:26,019 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:26,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:26,026 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:41:26,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26 BoogieIcfgContainer [2022-04-28 02:41:26,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:26,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:26,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:26,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:26,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:25" (1/3) ... [2022-04-28 02:41:26,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f94b34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 02:41:26,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (2/3) ... [2022-04-28 02:41:26,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f94b34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 02:41:26,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26" (3/3) ... [2022-04-28 02:41:26,047 INFO L111 eAbstractionObserver]: Analyzing ICFG array-2.c [2022-04-28 02:41:26,073 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:26,074 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:26,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:26,148 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5126153f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56db9755 [2022-04-28 02:41:26,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:41:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:41:26,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:26,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:26,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 1 times [2022-04-28 02:41:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213831216] [2022-04-28 02:41:26,181 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash -588233041, now seen corresponding path program 2 times [2022-04-28 02:41:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:26,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458858252] [2022-04-28 02:41:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 02:41:26,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 02:41:26,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-28 02:41:26,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:26,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 02:41:26,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 02:41:26,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2022-04-28 02:41:26,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret10 := main(); {25#true} is VALID [2022-04-28 02:41:26,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {25#true} is VALID [2022-04-28 02:41:26,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 02:41:26,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {26#false} is VALID [2022-04-28 02:41:26,401 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem9 > ~menor~0 then 1 else 0)); {26#false} is VALID [2022-04-28 02:41:26,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 02:41:26,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 02:41:26,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 02:41:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:26,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458858252] [2022-04-28 02:41:26,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458858252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:26,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:26,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213831216] [2022-04-28 02:41:26,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213831216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61468239] [2022-04-28 02:41:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:26,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:26,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:26,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:41:26,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:41:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:26,479 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,594 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 02:41:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:41:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 02:41:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 02:41:26,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 02:41:26,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:26,682 INFO L225 Difference]: With dead ends: 35 [2022-04-28 02:41:26,683 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:41:26,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:26,690 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:26,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:41:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:41:26,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:26,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,728 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,728 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,733 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:41:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:41:26,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:26,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:26,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:41:26,735 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:41:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:26,738 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:41:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:41:26,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:26,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:26,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:26,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 02:41:26,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 02:41:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:26,743 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 02:41:26,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:26,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 02:41:26,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:41:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:41:26,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:26,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:26,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:26,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 1 times [2022-04-28 02:41:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607255922] [2022-04-28 02:41:26,785 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -903153702, now seen corresponding path program 2 times [2022-04-28 02:41:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:26,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143499092] [2022-04-28 02:41:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-04-28 02:41:26,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 02:41:26,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-28 02:41:26,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:26,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-04-28 02:41:26,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 02:41:26,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #44#return; {163#true} is VALID [2022-04-28 02:41:26,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret10 := main(); {163#true} is VALID [2022-04-28 02:41:26,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~menor~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {168#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-28 02:41:26,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#(and (= main_~j~0 0) (= main_~SIZE~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {164#false} is VALID [2022-04-28 02:41:26,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#false} call #t~mem9 := read~int(~#array~0.base, ~#array~0.offset, 4); {164#false} is VALID [2022-04-28 02:41:26,986 INFO L272 TraceCheckUtils]: 8: Hoare triple {164#false} call __VERIFIER_assert((if #t~mem9 > ~menor~0 then 1 else 0)); {164#false} is VALID [2022-04-28 02:41:26,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} ~cond := #in~cond; {164#false} is VALID [2022-04-28 02:41:26,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} assume 0 == ~cond; {164#false} is VALID [2022-04-28 02:41:26,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 02:41:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143499092] [2022-04-28 02:41:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143499092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:26,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607255922] [2022-04-28 02:41:26,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607255922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022174000] [2022-04-28 02:41:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:26,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:26,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:41:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:41:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:41:27,011 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,102 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 02:41:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:41:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 02:41:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 02:41:27,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 02:41:27,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:27,137 INFO L225 Difference]: With dead ends: 24 [2022-04-28 02:41:27,137 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 02:41:27,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:27,140 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:27,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 02:41:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-28 02:41:27,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:27,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,162 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,163 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,170 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:41:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:41:27,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:27,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:27,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:41:27,172 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 02:41:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,174 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 02:41:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 02:41:27,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:27,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:27,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:27,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 02:41:27,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-28 02:41:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:27,179 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 02:41:27,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:27,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 02:41:27,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 02:41:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:27,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:27,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:27,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:27,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 1 times [2022-04-28 02:41:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556383880] [2022-04-28 02:41:27,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:27,255 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:27,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1274683932, now seen corresponding path program 2 times [2022-04-28 02:41:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:27,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107480773] [2022-04-28 02:41:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:27,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:41:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:27,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:41:27,369 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 02:41:27,369 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 02:41:27,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:41:27,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:41:27,376 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 02:41:27,380 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:41:27,390 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:41:27,390 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 02:41:27,390 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-28 02:41:27,391 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 02:41:27,392 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 02:41:27,393 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-28 02:41:27,393 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 02:41:27,393 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 02:41:27,393 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:41:27,393 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:41:27,393 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:41:27,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:27 BoogieIcfgContainer [2022-04-28 02:41:27,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:41:27,396 INFO L158 Benchmark]: Toolchain (without parser) took 1943.04ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 154.3MB in the beginning and 245.8MB in the end (delta: -91.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:27,396 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:27,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 211.8MB. Free memory was 154.2MB in the beginning and 180.7MB in the end (delta: -26.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-28 02:41:27,397 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 211.8MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:41:27,397 INFO L158 Benchmark]: RCFGBuilder took 333.65ms. Allocated memory is still 211.8MB. Free memory was 179.1MB in the beginning and 167.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:41:27,397 INFO L158 Benchmark]: TraceAbstraction took 1365.28ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 167.1MB in the beginning and 245.8MB in the end (delta: -78.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:27,398 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 211.8MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 211.8MB. Free memory was 154.2MB in the beginning and 180.7MB in the end (delta: -26.5MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 211.8MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 333.65ms. Allocated memory is still 211.8MB. Free memory was 179.1MB in the beginning and 167.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1365.28ms. Allocated memory was 211.8MB in the beginning and 289.4MB in the end (delta: 77.6MB). Free memory was 167.1MB in the beginning and 245.8MB in the end (delta: -78.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] unsigned int SIZE=1; [L16] unsigned int j,k; [L17] int array[SIZE], menor; [L19] menor = __VERIFIER_nondet_int() [L21] j=0 [L21] COND TRUE jmenor) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 35 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 02:41:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...