/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:38:41,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:38:41,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:38:41,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:38:41,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:38:41,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:38:41,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:38:41,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:38:41,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:38:41,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:38:41,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:38:41,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:38:41,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:38:41,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:38:41,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:38:41,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:38:41,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:38:41,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:38:41,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:38:41,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:38:41,176 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:38:41,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:38:41,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:38:41,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:38:41,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:38:41,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:38:41,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:38:41,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:38:41,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:38:41,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:38:41,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:38:41,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:38:41,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:38:41,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:38:41,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:38:41,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:38:41,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:38:41,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:38:41,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:38:41,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:38:41,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:38:41,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:38:41,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:38:41,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:38:41,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:38:41,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:38:41,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:38:41,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:38:41,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:38:41,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:38:41,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:38:41,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:38:41,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:38:41,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:38:41,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:38:41,202 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:38:41,203 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 10:38:41,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:38:41,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:38:41,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:38:41,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:38:41,401 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:38:41,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-28 10:38:41,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d442743a7/398ce65a44594fafab51626e0b7e7bf2/FLAG315429d04 [2022-04-28 10:38:41,798 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:38:41,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-28 10:38:41,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d442743a7/398ce65a44594fafab51626e0b7e7bf2/FLAG315429d04 [2022-04-28 10:38:41,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d442743a7/398ce65a44594fafab51626e0b7e7bf2 [2022-04-28 10:38:41,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:38:41,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:38:41,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:38:41,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:38:41,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:38:41,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:38:41" (1/1) ... [2022-04-28 10:38:41,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46654b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:41, skipping insertion in model container [2022-04-28 10:38:41,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:38:41" (1/1) ... [2022-04-28 10:38:41,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:38:41,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:38:41,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i[873,886] [2022-04-28 10:38:41,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:38:41,998 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:38:42,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i[873,886] [2022-04-28 10:38:42,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:38:42,031 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:38:42,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42 WrapperNode [2022-04-28 10:38:42,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:38:42,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:38:42,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:38:42,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:38:42,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:38:42,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:38:42,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:38:42,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:38:42,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (1/1) ... [2022-04-28 10:38:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:38:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:42,129 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 10:38:42,140 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 10:38:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:38:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:38:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:38:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:38:42,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:38:42,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:38:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:38:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:38:42,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:38:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:38:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:38:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:38:42,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:38:42,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:38:42,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:38:42,244 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:38:42,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:38:42,368 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:38:42,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:38:42,373 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:38:42,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:38:42 BoogieIcfgContainer [2022-04-28 10:38:42,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:38:42,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:38:42,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:38:42,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:38:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:38:41" (1/3) ... [2022-04-28 10:38:42,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae6c6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:38:42, skipping insertion in model container [2022-04-28 10:38:42,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:42" (2/3) ... [2022-04-28 10:38:42,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae6c6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:38:42, skipping insertion in model container [2022-04-28 10:38:42,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:38:42" (3/3) ... [2022-04-28 10:38:42,379 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark05_conjunctive.i [2022-04-28 10:38:42,389 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:38:42,390 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:38:42,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:38:42,427 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@1a4a4a40, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a595867 [2022-04-28 10:38:42,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:38:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 10:38:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:38:42,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:42,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:42,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 1 times [2022-04-28 10:38:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987388662] [2022-04-28 10:38:42,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:38:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1005951186, now seen corresponding path program 2 times [2022-04-28 10:38:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:42,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176629467] [2022-04-28 10:38:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:42,652 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(26, 2); {24#true} is VALID [2022-04-28 10:38:42,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:38:42,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-28 10:38:42,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:42,655 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(26, 2); {24#true} is VALID [2022-04-28 10:38:42,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:38:42,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #51#return; {24#true} is VALID [2022-04-28 10:38:42,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 10:38:42,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {24#true} is VALID [2022-04-28 10:38:42,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {29#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-28 10:38:42,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= (+ main_~x~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {25#false} is VALID [2022-04-28 10:38:42,657 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {25#false} is VALID [2022-04-28 10:38:42,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 10:38:42,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:38:42,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:38:42,658 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 10:38:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176629467] [2022-04-28 10:38:42,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176629467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:42,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:42,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:38:42,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987388662] [2022-04-28 10:38:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987388662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:42,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:42,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:38:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332699385] [2022-04-28 10:38:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:42,665 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 10:38:42,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:42,668 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 10:38:42,679 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 10:38:42,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:38:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:42,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:38:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:38:42,696 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 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 10:38:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:42,842 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 10:38:42,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:38:42,843 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 10:38:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:42,845 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 10:38:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 10:38:42,853 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 10:38:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 10:38:42,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 10:38:42,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:42,912 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:38:42,913 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:38:42,915 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 10:38:42,920 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:42,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:38:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:38:42,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:42,941 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 10:38:42,941 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 10:38:42,942 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 10:38:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:42,943 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:38:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:38:42,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:42,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:42,944 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 10:38:42,944 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 10:38:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:42,945 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 10:38:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:38:42,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:42,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:42,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:42,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:42,946 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 10:38:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:38:42,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 10:38:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:42,948 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:38:42,949 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 10:38:42,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:38:42,988 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 10:38:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:38:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:38:42,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:42,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:42,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:38:42,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1392462319, now seen corresponding path program 1 times [2022-04-28 10:38:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471943243] [2022-04-28 10:38:43,017 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:43,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:43,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1392462319, now seen corresponding path program 2 times [2022-04-28 10:38:43,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:43,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534750477] [2022-04-28 10:38:43,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:43,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#(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(26, 2); {163#true} is VALID [2022-04-28 10:38:43,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 10:38:43,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 10:38:43,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:43,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#(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(26, 2); {163#true} is VALID [2022-04-28 10:38:43,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 10:38:43,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 10:38:43,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret6 := main(); {163#true} is VALID [2022-04-28 10:38:43,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {163#true} is VALID [2022-04-28 10:38:43,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {168#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 10:38:43,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {169#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:38:43,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {170#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-28 10:38:43,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} assume !(~x~0 < ~n~0); {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:43,174 INFO L272 TraceCheckUtils]: 10: Hoare triple {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {172#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:38:43,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {173#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:38:43,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-28 10:38:43,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 10:38:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:43,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534750477] [2022-04-28 10:38:43,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534750477] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:43,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208998331] [2022-04-28 10:38:43,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:38:43,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:43,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:43,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:38:43,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:38:43,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:38:43,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:43,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:38:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:43,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:43,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2022-04-28 10:38:43,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} #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(26, 2); {163#true} is VALID [2022-04-28 10:38:43,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 10:38:43,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 10:38:43,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret6 := main(); {163#true} is VALID [2022-04-28 10:38:43,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {163#true} is VALID [2022-04-28 10:38:43,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {168#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 10:38:43,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {169#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:38:43,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {202#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-28 10:38:43,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} assume !(~x~0 < ~n~0); {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:43,654 INFO L272 TraceCheckUtils]: 10: Hoare triple {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:43,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:43,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {164#false} is VALID [2022-04-28 10:38:43,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 10:38:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:43,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:43,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-28 10:38:43,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {164#false} is VALID [2022-04-28 10:38:43,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:43,855 INFO L272 TraceCheckUtils]: 10: Hoare triple {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:43,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} assume !(~x~0 < ~n~0); {171#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:43,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {232#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-28 10:38:43,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {236#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-28 10:38:43,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {240#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-28 10:38:43,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {163#true} is VALID [2022-04-28 10:38:43,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret6 := main(); {163#true} is VALID [2022-04-28 10:38:43,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #51#return; {163#true} is VALID [2022-04-28 10:38:43,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-28 10:38:43,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} #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(26, 2); {163#true} is VALID [2022-04-28 10:38:43,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {163#true} is VALID [2022-04-28 10:38:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:43,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208998331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:43,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:43,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 10:38:43,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:43,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471943243] [2022-04-28 10:38:43,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471943243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:43,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:43,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:38:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910912907] [2022-04-28 10:38:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-28 10:38:43,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:43,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:38:43,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:43,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:38:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:38:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:38:43,877 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:38:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:44,068 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 10:38:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:38:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-28 10:38:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:38:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-28 10:38:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:38:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-28 10:38:44,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2022-04-28 10:38:44,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:44,104 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:38:44,104 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:38:44,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:38:44,105 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:44,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:38:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:38:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 10:38:44,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:44,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,112 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,112 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:44,113 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 10:38:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:38:44,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:44,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:44,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,114 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:44,115 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 10:38:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 10:38:44,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:44,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:44,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:44,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 10:38:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:38:44,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-28 10:38:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:44,120 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:38:44,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10:38:44,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:38:44,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:38:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:38:44,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:44,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:44,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:44,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:44,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash -832493620, now seen corresponding path program 3 times [2022-04-28 10:38:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:44,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095261227] [2022-04-28 10:38:44,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:44,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -832493620, now seen corresponding path program 4 times [2022-04-28 10:38:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:44,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772104965] [2022-04-28 10:38:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:44,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:44,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#(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(26, 2); {398#true} is VALID [2022-04-28 10:38:44,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-28 10:38:44,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} #51#return; {398#true} is VALID [2022-04-28 10:38:44,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:44,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#(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(26, 2); {398#true} is VALID [2022-04-28 10:38:44,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-28 10:38:44,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #51#return; {398#true} is VALID [2022-04-28 10:38:44,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret6 := main(); {398#true} is VALID [2022-04-28 10:38:44,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {398#true} is VALID [2022-04-28 10:38:44,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {403#(<= main_~x~0 main_~y~0)} is VALID [2022-04-28 10:38:44,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {403#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {404#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:38:44,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 10:38:44,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {406#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:38:44,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {406#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {407#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-28 10:38:44,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} assume !(~x~0 < ~n~0); {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:44,469 INFO L272 TraceCheckUtils]: 12: Hoare triple {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {409#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:38:44,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {409#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {410#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:38:44,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {410#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {399#false} is VALID [2022-04-28 10:38:44,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-04-28 10:38:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772104965] [2022-04-28 10:38:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772104965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423738180] [2022-04-28 10:38:44,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:38:44,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:44,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:38:44,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:38:44,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:38:44,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:44,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:38:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:44,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:44,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {398#true} is VALID [2022-04-28 10:38:44,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} #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(26, 2); {398#true} is VALID [2022-04-28 10:38:44,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-28 10:38:44,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #51#return; {398#true} is VALID [2022-04-28 10:38:44,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret6 := main(); {398#true} is VALID [2022-04-28 10:38:44,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {398#true} is VALID [2022-04-28 10:38:44,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {403#(<= main_~x~0 main_~y~0)} is VALID [2022-04-28 10:38:44,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {403#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {404#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:38:44,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 10:38:44,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {406#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-28 10:38:44,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {406#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {445#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-28 10:38:44,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} assume !(~x~0 < ~n~0); {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:44,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:44,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:44,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {399#false} is VALID [2022-04-28 10:38:44,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-04-28 10:38:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:44,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:45,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-04-28 10:38:45,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {399#false} is VALID [2022-04-28 10:38:45,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:45,037 INFO L272 TraceCheckUtils]: 12: Hoare triple {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == ~n~0 then 1 else 0)); {452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:45,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} assume !(~x~0 < ~n~0); {408#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-28 10:38:45,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {479#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {475#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-28 10:38:45,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {479#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-28 10:38:45,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#(<= main_~x~0 (+ main_~y~0 1))} assume ~x~0 > ~y~0;#t~post5 := ~y~0;~y~0 := 1 + #t~post5;havoc #t~post5; {405#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 10:38:45,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {403#(<= main_~x~0 main_~y~0)} assume !!(~x~0 < ~n~0);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {404#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-28 10:38:45,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#true} assume !!((~x~0 >= 0 && ~x~0 <= ~y~0) && ~y~0 < ~n~0); {403#(<= main_~x~0 main_~y~0)} is VALID [2022-04-28 10:38:45,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {398#true} is VALID [2022-04-28 10:38:45,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret6 := main(); {398#true} is VALID [2022-04-28 10:38:45,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #51#return; {398#true} is VALID [2022-04-28 10:38:45,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-28 10:38:45,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} #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(26, 2); {398#true} is VALID [2022-04-28 10:38:45,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {398#true} is VALID [2022-04-28 10:38:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423738180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:45,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 10:38:45,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:45,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095261227] [2022-04-28 10:38:45,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095261227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:45,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:45,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:38:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110451989] [2022-04-28 10:38:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 16 [2022-04-28 10:38:45,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:45,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 10:38:45,064 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 10:38:45,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:38:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:38:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:38:45,066 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 10:38:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:45,282 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:38:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:38:45,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 16 [2022-04-28 10:38:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 10:38:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-28 10:38:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 10:38:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-28 10:38:45,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-28 10:38:45,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:45,301 INFO L225 Difference]: With dead ends: 21 [2022-04-28 10:38:45,301 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:38:45,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:38:45,302 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:45,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:38:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:38:45,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:45,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 10:38:45,304 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 10:38:45,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 10:38:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:45,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:38:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:45,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:45,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:45,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-28 10:38:45,304 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-28 10:38:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:45,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:38:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:45,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:45,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:45,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:45,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-28 10:38:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:38:45,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 10:38:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:45,305 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:38:45,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 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 10:38:45,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:38:45,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:45,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:45,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:38:45,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:45,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 10:38:45,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:38:45,594 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 10:38:45,594 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 10:38:45,594 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 10:38:45,594 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:45,594 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 1))) (and (<= .cse0 main_~n~0) (<= main_~x~0 .cse0))) [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 24 27) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 main_~y~0))) (or (and .cse0 (< main_~y~0 (+ main_~n~0 1)) (<= main_~y~0 main_~x~0)) (and (<= (+ main_~y~0 1) main_~n~0) .cse0))) [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,595 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:38:45,596 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:38:45,596 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:45,596 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:38:45,598 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-28 10:38:45,599 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:38:45,601 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:38:45,601 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:38:45,603 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 10:38:45,610 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:38:45,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:38:45 BoogieIcfgContainer [2022-04-28 10:38:45,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:38:45,617 INFO L158 Benchmark]: Toolchain (without parser) took 3803.03ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 136.5MB in the beginning and 169.2MB in the end (delta: -32.7MB). Peak memory consumption was 36.1MB. Max. memory is 8.0GB. [2022-04-28 10:38:45,617 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:38:45,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.79ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 160.3MB in the end (delta: -23.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-28 10:38:45,617 INFO L158 Benchmark]: Boogie Preprocessor took 45.39ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 159.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:38:45,617 INFO L158 Benchmark]: RCFGBuilder took 294.39ms. Allocated memory is still 190.8MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:38:45,618 INFO L158 Benchmark]: TraceAbstraction took 3240.94ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 146.7MB in the beginning and 169.2MB in the end (delta: -22.5MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-04-28 10:38:45,618 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.13ms. Allocated memory is still 190.8MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.79ms. Allocated memory is still 190.8MB. Free memory was 136.4MB in the beginning and 160.3MB in the end (delta: -23.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.39ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 159.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 294.39ms. Allocated memory is still 190.8MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3240.94ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 146.7MB in the beginning and 169.2MB in the end (delta: -22.5MB). Peak memory consumption was 47.2MB. 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 39 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 45 PreInvPairs, 63 NumberOfFragments, 77 HoareAnnotationTreeSize, 45 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((x <= y && y < n + 1) && y <= x) || (y + 1 <= n && x <= y) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:38:45,639 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...