/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/up.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:11:47,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:11:47,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:11:47,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:11:47,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:11:47,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:11:47,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:11:47,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:11:47,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:11:47,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:11:47,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:11:47,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:11:47,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:11:47,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:11:47,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:11:47,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:11:47,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:11:47,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:11:47,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:11:47,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:11:47,094 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:11:47,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:11:47,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:11:47,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:11:47,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:11:47,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:11:47,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:11:47,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:11:47,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:11:47,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:11:47,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:11:47,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:11:47,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:11:47,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:11:47,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:11:47,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:11:47,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:11:47,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:11:47,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:11:47,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:11:47,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:11:47,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:11:47,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:11:47,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:11:47,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:11:47,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:11:47,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:11:47,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:11:47,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:11:47,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:11:47,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:11:47,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:11:47,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:11:47,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:11:47,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:11:47,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:11:47,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:11:47,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:47,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:11:47,128 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:11:47,129 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:11:47,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:11:47,129 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:11:47,129 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 03:11:47,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:11:47,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:11:47,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:11:47,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:11:47,399 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:11:47,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up.i [2022-04-28 03:11:47,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d051f659e/f61b5fe1ce8944deac02713715b2c838/FLAG154d5c859 [2022-04-28 03:11:47,843 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:11:47,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up.i [2022-04-28 03:11:47,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d051f659e/f61b5fe1ce8944deac02713715b2c838/FLAG154d5c859 [2022-04-28 03:11:48,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d051f659e/f61b5fe1ce8944deac02713715b2c838 [2022-04-28 03:11:48,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:11:48,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:11:48,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:48,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:11:48,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:11:48,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecb711f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48, skipping insertion in model container [2022-04-28 03:11:48,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:11:48,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:11:48,507 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-invgen/up.i[893,906] [2022-04-28 03:11:48,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:48,541 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:11:48,554 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-invgen/up.i[893,906] [2022-04-28 03:11:48,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:48,570 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:11:48,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48 WrapperNode [2022-04-28 03:11:48,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:48,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:11:48,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:11:48,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:11:48,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:11:48,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:11:48,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:11:48,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:11:48,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (1/1) ... [2022-04-28 03:11:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:48,644 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 03:11:48,684 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 03:11:48,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:11:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:11:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:11:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:11:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:11:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:11:48,699 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:11:48,699 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:11:48,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:11:48,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:11:48,700 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:11:48,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:11:48,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:11:48,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:11:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:11:48,755 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:11:48,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:11:48,865 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:11:48,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:11:48,870 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:11:48,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:48 BoogieIcfgContainer [2022-04-28 03:11:48,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:11:48,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:11:48,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:11:48,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:11:48,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:11:48" (1/3) ... [2022-04-28 03:11:48,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7e7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:48, skipping insertion in model container [2022-04-28 03:11:48,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:48" (2/3) ... [2022-04-28 03:11:48,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a7e7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:48, skipping insertion in model container [2022-04-28 03:11:48,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:48" (3/3) ... [2022-04-28 03:11:48,880 INFO L111 eAbstractionObserver]: Analyzing ICFG up.i [2022-04-28 03:11:48,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:11:48,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:11:48,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:11:48,986 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@4d379bb7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@446a2fb9 [2022-04-28 03:11:48,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:11:48,997 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 03:11:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:11:49,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:49,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:49,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 661364838, now seen corresponding path program 1 times [2022-04-28 03:11:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:49,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54415822] [2022-04-28 03:11:49,034 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 661364838, now seen corresponding path program 2 times [2022-04-28 03:11:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422622104] [2022-04-28 03:11:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:49,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(9, 2); {24#true} is VALID [2022-04-28 03:11:49,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:11:49,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #63#return; {24#true} is VALID [2022-04-28 03:11:49,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:49,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(9, 2); {24#true} is VALID [2022-04-28 03:11:49,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:11:49,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #63#return; {24#true} is VALID [2022-04-28 03:11:49,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-28 03:11:49,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;~i~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29#(= main_~i~0 0)} is VALID [2022-04-28 03:11:49,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {30#(<= main_~n~0 0)} is VALID [2022-04-28 03:11:49,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(<= main_~n~0 0)} ~j~0 := 0; {31#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:49,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(and (= main_~j~0 0) (<= main_~n~0 0))} assume !!(~j~0 < ~n~0); {25#false} is VALID [2022-04-28 03:11:49,331 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25#false} is VALID [2022-04-28 03:11:49,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:11:49,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:11:49,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:11:49,332 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 03:11:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422622104] [2022-04-28 03:11:49,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422622104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:49,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54415822] [2022-04-28 03:11:49,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54415822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:49,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:49,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:49,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436068998] [2022-04-28 03:11:49,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 03:11:49,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:49,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:11:49,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:49,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:49,396 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 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:11:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:49,602 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 03:11:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:11:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-28 03:11:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:11:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:11:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:11:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:11:49,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-28 03:11:49,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:49,698 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:11:49,699 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:11:49,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:11:49,705 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:49,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:11:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:11:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:11:49,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:49,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:49,731 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:49,731 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:49,734 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 03:11:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 03:11:49,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:49,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:49,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 03:11:49,735 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 03:11:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:49,737 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-28 03:11:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 03:11:49,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:49,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:49,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:49,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 03:11:49,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-28 03:11:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:49,741 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 03:11:49,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 03:11:49,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 03:11:49,761 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 03:11:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 03:11:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:11:49,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:49,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:49,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:11:49,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1204460846, now seen corresponding path program 1 times [2022-04-28 03:11:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:49,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232614803] [2022-04-28 03:11:50,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:11:50,032 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:11:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -768649777, now seen corresponding path program 1 times [2022-04-28 03:11:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:50,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870998147] [2022-04-28 03:11:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:50,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(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(9, 2); {193#true} is VALID [2022-04-28 03:11:50,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2022-04-28 03:11:50,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #63#return; {193#true} is VALID [2022-04-28 03:11:50,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:50,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(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(9, 2); {193#true} is VALID [2022-04-28 03:11:50,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2022-04-28 03:11:50,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #63#return; {193#true} is VALID [2022-04-28 03:11:50,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret6 := main(); {193#true} is VALID [2022-04-28 03:11:50,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#true} havoc ~n~0;~i~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {198#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:11:50,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(and (= main_~k~0 0) (= main_~i~0 0))} [67] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_6 v_main_~i~0_5)) (.cse1 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse3 (= v_main_~k~0_9 v_main_~k~0_8))) (or (and .cse0 .cse1 .cse2 (= v_main_~n~0_8 v_main_~n~0_8) .cse3) (and (< v_main_~i~0_5 (+ v_main_~n~0_8 1)) (= (+ v_main_~i~0_5 v_main_~k~0_9) (+ v_main_~i~0_6 v_main_~k~0_8)) (< v_main_~i~0_6 v_main_~i~0_5)) (and .cse0 .cse1 .cse2 .cse3 (not (< v_main_~i~0_6 v_main_~n~0_8))))) InVars {main_~i~0=v_main_~i~0_6, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_8, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_8, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {199#(or (<= main_~i~0 main_~k~0) (= main_~i~0 0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:50,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(or (<= main_~i~0 main_~k~0) (= main_~i~0 0) (<= main_~n~0 0))} [66] L29-3_primed-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {200#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:50,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {200#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} ~j~0 := 0; {201#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:50,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~j~0 < ~n~0); {202#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:50,204 INFO L272 TraceCheckUtils]: 10: Hoare triple {202#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:50,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:50,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {194#false} is VALID [2022-04-28 03:11:50,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-04-28 03:11:50,206 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 03:11:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:50,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870998147] [2022-04-28 03:11:50,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870998147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:50,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:50,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:11:50,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:50,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232614803] [2022-04-28 03:11:50,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232614803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:50,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:50,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:11:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259809849] [2022-04-28 03:11:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:50,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:50,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,321 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 03:11:50,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:11:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:50,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:11:50,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:11:50,323 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:50,741 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-28 03:11:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:11:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-28 03:11:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-28 03:11:50,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 28 transitions. [2022-04-28 03:11:50,781 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 03:11:50,784 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:11:50,784 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:11:50,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:11:50,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:50,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 43 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:11:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 03:11:50,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:50,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:11:50,809 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:11:50,809 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:11:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:50,811 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 03:11:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:11:50,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:50,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:50,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 03:11:50,815 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 03:11:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:50,826 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 03:11:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:11:50,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:50,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:50,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:50,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:11:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 03:11:50,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2022-04-28 03:11:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:50,828 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 03:11:50,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 03:11:50,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 03:11:50,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 03:11:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:11:50,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:50,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:50,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:11:50,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -801413244, now seen corresponding path program 1 times [2022-04-28 03:11:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:50,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878310725] [2022-04-28 03:11:54,181 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:11:54,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:11:54,337 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:11:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 833048451, now seen corresponding path program 1 times [2022-04-28 03:11:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:54,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992494937] [2022-04-28 03:11:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:54,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(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(9, 2); {376#true} is VALID [2022-04-28 03:11:54,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:54,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376#true} {376#true} #63#return; {376#true} is VALID [2022-04-28 03:11:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 03:11:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:54,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#true} ~cond := #in~cond; {376#true} is VALID [2022-04-28 03:11:54,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#true} assume !(0 == ~cond); {376#true} is VALID [2022-04-28 03:11:54,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:54,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376#true} {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} #61#return; {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:54,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:54,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(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(9, 2); {376#true} is VALID [2022-04-28 03:11:54,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:54,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #63#return; {376#true} is VALID [2022-04-28 03:11:54,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret6 := main(); {376#true} is VALID [2022-04-28 03:11:54,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#true} havoc ~n~0;~i~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {381#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:11:54,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(and (= main_~k~0 0) (= main_~i~0 0))} [69] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_13 v_main_~i~0_12)) (.cse1 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse2 (= |v_main_#t~post3_9| |v_main_#t~post3_8|)) (.cse3 (= v_main_~k~0_16 v_main_~k~0_15))) (or (and .cse0 .cse1 .cse2 (= v_main_~n~0_10 v_main_~n~0_10) .cse3) (and .cse0 .cse1 .cse2 (<= v_main_~n~0_10 v_main_~i~0_13) .cse3) (let ((.cse4 (+ v_main_~i~0_13 v_main_~k~0_15))) (and (< v_main_~k~0_16 v_main_~k~0_15) (= .cse4 (+ v_main_~i~0_12 v_main_~k~0_16)) (< .cse4 (+ v_main_~k~0_16 v_main_~n~0_10 1)))))) InVars {main_~i~0=v_main_~i~0_13, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_10, main_#t~post3=|v_main_#t~post3_9|, main_~k~0=v_main_~k~0_16} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post2=|v_main_#t~post2_8|, main_#t~post3=|v_main_#t~post3_8|, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_15} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {382#(or (<= main_~i~0 main_~k~0) (= main_~i~0 0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:54,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#(or (<= main_~i~0 main_~k~0) (= main_~i~0 0) (<= main_~n~0 0))} [68] L29-3_primed-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {383#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:54,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} ~j~0 := 0; {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:54,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~j~0 < ~n~0); {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:54,579 INFO L272 TraceCheckUtils]: 10: Hoare triple {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {376#true} is VALID [2022-04-28 03:11:54,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#true} ~cond := #in~cond; {376#true} is VALID [2022-04-28 03:11:54,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#true} assume !(0 == ~cond); {376#true} is VALID [2022-04-28 03:11:54,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:54,581 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {376#true} {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} #61#return; {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:54,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {384#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {389#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} is VALID [2022-04-28 03:11:54,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {389#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} assume !!(~j~0 < ~n~0); {390#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:54,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {390#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:54,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:54,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {377#false} is VALID [2022-04-28 03:11:54,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#false} assume !false; {377#false} is VALID [2022-04-28 03:11:54,587 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 03:11:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992494937] [2022-04-28 03:11:54,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992494937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:11:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625766784] [2022-04-28 03:11:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:11:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:54,590 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 03:11:54,599 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 03:11:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:54,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:11:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:54,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:11:55,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2022-04-28 03:11:55,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#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(9, 2); {376#true} is VALID [2022-04-28 03:11:55,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:55,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #63#return; {376#true} is VALID [2022-04-28 03:11:55,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret6 := main(); {376#true} is VALID [2022-04-28 03:11:55,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#true} havoc ~n~0;~i~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {412#(and (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-28 03:11:55,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(and (<= 0 main_~k~0) (<= main_~i~0 0))} [69] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_13 v_main_~i~0_12)) (.cse1 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse2 (= |v_main_#t~post3_9| |v_main_#t~post3_8|)) (.cse3 (= v_main_~k~0_16 v_main_~k~0_15))) (or (and .cse0 .cse1 .cse2 (= v_main_~n~0_10 v_main_~n~0_10) .cse3) (and .cse0 .cse1 .cse2 (<= v_main_~n~0_10 v_main_~i~0_13) .cse3) (let ((.cse4 (+ v_main_~i~0_13 v_main_~k~0_15))) (and (< v_main_~k~0_16 v_main_~k~0_15) (= .cse4 (+ v_main_~i~0_12 v_main_~k~0_16)) (< .cse4 (+ v_main_~k~0_16 v_main_~n~0_10 1)))))) InVars {main_~i~0=v_main_~i~0_13, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_10, main_#t~post3=|v_main_#t~post3_9|, main_~k~0=v_main_~k~0_16} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post2=|v_main_#t~post2_8|, main_#t~post3=|v_main_#t~post3_8|, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_15} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {416#(or (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0)))} is VALID [2022-04-28 03:11:55,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {416#(or (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))) (and (<= 0 main_~k~0) (<= main_~i~0 0)))} [68] L29-3_primed-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {420#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} is VALID [2022-04-28 03:11:55,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} ~j~0 := 0; {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-28 03:11:55,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} assume !!(~j~0 < ~n~0); {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-28 03:11:55,494 INFO L272 TraceCheckUtils]: 10: Hoare triple {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {376#true} is VALID [2022-04-28 03:11:55,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#true} ~cond := #in~cond; {376#true} is VALID [2022-04-28 03:11:55,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#true} assume !(0 == ~cond); {376#true} is VALID [2022-04-28 03:11:55,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:55,495 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {376#true} {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} #61#return; {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-28 03:11:55,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {446#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} is VALID [2022-04-28 03:11:55,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {446#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} assume !!(~j~0 < ~n~0); {390#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:55,498 INFO L272 TraceCheckUtils]: 17: Hoare triple {390#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:11:55,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:11:55,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {377#false} is VALID [2022-04-28 03:11:55,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#false} assume !false; {377#false} is VALID [2022-04-28 03:11:55,501 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 03:11:55,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:11:56,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#false} assume !false; {377#false} is VALID [2022-04-28 03:11:56,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {377#false} is VALID [2022-04-28 03:11:56,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:11:56,283 INFO L272 TraceCheckUtils]: 17: Hoare triple {390#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:11:56,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {476#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} assume !!(~j~0 < ~n~0); {390#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:56,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4;#t~post5 := ~k~0;~k~0 := #t~post5 - 1;havoc #t~post5; {476#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} is VALID [2022-04-28 03:11:56,285 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {376#true} {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} #61#return; {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-28 03:11:56,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:56,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#true} assume !(0 == ~cond); {376#true} is VALID [2022-04-28 03:11:56,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#true} ~cond := #in~cond; {376#true} is VALID [2022-04-28 03:11:56,286 INFO L272 TraceCheckUtils]: 10: Hoare triple {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {376#true} is VALID [2022-04-28 03:11:56,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} assume !!(~j~0 < ~n~0); {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-28 03:11:56,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#(or (<= 2 main_~k~0) (<= main_~n~0 1))} ~j~0 := 0; {480#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-28 03:11:56,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#(or (< main_~i~0 main_~n~0) (<= 2 main_~k~0) (<= main_~n~0 1))} [68] L29-3_primed-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {502#(or (<= 2 main_~k~0) (<= main_~n~0 1))} is VALID [2022-04-28 03:11:56,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {510#(and (or (<= main_~i~0 1) (<= 2 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 main_~k~0)))} [69] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_13 v_main_~i~0_12)) (.cse1 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse2 (= |v_main_#t~post3_9| |v_main_#t~post3_8|)) (.cse3 (= v_main_~k~0_16 v_main_~k~0_15))) (or (and .cse0 .cse1 .cse2 (= v_main_~n~0_10 v_main_~n~0_10) .cse3) (and .cse0 .cse1 .cse2 (<= v_main_~n~0_10 v_main_~i~0_13) .cse3) (let ((.cse4 (+ v_main_~i~0_13 v_main_~k~0_15))) (and (< v_main_~k~0_16 v_main_~k~0_15) (= .cse4 (+ v_main_~i~0_12 v_main_~k~0_16)) (< .cse4 (+ v_main_~k~0_16 v_main_~n~0_10 1)))))) InVars {main_~i~0=v_main_~i~0_13, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_10, main_#t~post3=|v_main_#t~post3_9|, main_~k~0=v_main_~k~0_16} OutVars{main_~i~0=v_main_~i~0_12, main_#t~post2=|v_main_#t~post2_8|, main_#t~post3=|v_main_#t~post3_8|, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_15} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {506#(or (< main_~i~0 main_~n~0) (<= 2 main_~k~0) (<= main_~n~0 1))} is VALID [2022-04-28 03:11:56,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#true} havoc ~n~0;~i~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {510#(and (or (<= main_~i~0 1) (<= 2 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 main_~k~0)))} is VALID [2022-04-28 03:11:56,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret6 := main(); {376#true} is VALID [2022-04-28 03:11:56,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #63#return; {376#true} is VALID [2022-04-28 03:11:56,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-28 03:11:56,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#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(9, 2); {376#true} is VALID [2022-04-28 03:11:56,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2022-04-28 03:11:56,291 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 03:11:56,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625766784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:11:56,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:11:56,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 03:11:56,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:56,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878310725] [2022-04-28 03:11:56,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878310725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:56,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:56,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:11:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644851027] [2022-04-28 03:11:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:56,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 03:11:56,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:56,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:56,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:56,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:11:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:11:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:11:56,441 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,938 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 03:11:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:11:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 03:11:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-28 03:11:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2022-04-28 03:11:56,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 23 transitions. [2022-04-28 03:11:56,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:56,970 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:11:56,970 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:11:56,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:11:56,973 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:56,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:11:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:11:56,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:56,974 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 03:11:56,974 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 03:11:56,974 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 03:11:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:11:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:56,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:56,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:56,975 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 03:11:56,975 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 03:11:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,975 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:11:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:56,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:56,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:56,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:56,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:56,976 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 03:11:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:11:56,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-04-28 03:11:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:56,976 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:11:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:56,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:11:56,977 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 03:11:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:56,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:56,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:11:57,008 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 03:11:57,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:11:57,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:57,412 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:57,413 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 32) the Hoare annotation is: (or (and (or (and (< 1 main_~i~0) (= main_~i~0 main_~k~0)) (and (= main_~i~0 1) (= main_~k~0 1))) (< main_~i~0 (+ main_~n~0 1))) (and (= main_~k~0 0) (= main_~i~0 0))) [2022-04-28 03:11:57,413 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 32) the Hoare annotation is: (or (and (or (and (< 1 main_~i~0) (= main_~i~0 main_~k~0)) (and (= main_~i~0 1) (= main_~k~0 1))) (<= main_~n~0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))) (and (= main_~i~0 0) (<= main_~n~0 0))) [2022-04-28 03:11:57,413 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 39) the Hoare annotation is: true [2022-04-28 03:11:57,413 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 38) the Hoare annotation is: (or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0) (and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 0))) [2022-04-28 03:11:57,413 INFO L902 garLoopResultBuilder]: At program point L34-3(lines 24 39) the Hoare annotation is: true [2022-04-28 03:11:57,413 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-28 03:11:57,413 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= 1 main_~k~0)) [2022-04-28 03:11:57,413 INFO L895 garLoopResultBuilder]: At program point L35-1(line 35) the Hoare annotation is: (and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= 1 main_~k~0)) [2022-04-28 03:11:57,413 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 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 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:11:57,414 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:11:57,414 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:11:57,414 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:11:57,415 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:11:57,415 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 03:11:57,417 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-28 03:11:57,419 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:11:57,421 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:57,421 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:57,422 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:11:57,423 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:11:57,423 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:57,423 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:57,428 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:11:57,434 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 03:11:57,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:11:57 BoogieIcfgContainer [2022-04-28 03:11:57,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:11:57,443 INFO L158 Benchmark]: Toolchain (without parser) took 9182.61ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 127.2MB in the beginning and 181.1MB in the end (delta: -53.9MB). Peak memory consumption was 95.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:57,444 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:57,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.54ms. Allocated memory is still 173.0MB. Free memory was 126.9MB in the beginning and 151.6MB in the end (delta: -24.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-28 03:11:57,444 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 173.0MB. Free memory was 151.6MB in the beginning and 150.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:11:57,445 INFO L158 Benchmark]: RCFGBuilder took 255.89ms. Allocated memory is still 173.0MB. Free memory was 150.2MB in the beginning and 139.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:11:57,445 INFO L158 Benchmark]: TraceAbstraction took 8568.74ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 138.3MB in the beginning and 181.1MB in the end (delta: -42.8MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2022-04-28 03:11:57,446 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 173.0MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.54ms. Allocated memory is still 173.0MB. Free memory was 126.9MB in the beginning and 151.6MB in the end (delta: -24.7MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 173.0MB. Free memory was 151.6MB in the beginning and 150.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 255.89ms. Allocated memory is still 173.0MB. Free memory was 150.2MB in the beginning and 139.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8568.74ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 138.3MB in the beginning and 181.1MB in the end (delta: -42.8MB). Peak memory consumption was 106.5MB. 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: 19]: 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 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 38 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 53 NumberOfFragments, 147 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 199 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: 29]: Loop Invariant Derived loop invariant: (((1 < i && i == k) || (i == 1 && k == 1)) && i < n + 1) || (k == 0 && i == 0) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (n <= k + j || n + 1 <= j) || ((j == 0 && i == 0) && n <= 0) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 03:11:57,485 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...