/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/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:10:55,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:10:55,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:10:56,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:10:56,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:10:56,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:10:56,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:10:56,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:10:56,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:10:56,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:10:56,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:10:56,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:10:56,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:10:56,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:10:56,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:10:56,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:10:56,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:10:56,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:10:56,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:10:56,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:10:56,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:10:56,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:10:56,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:10:56,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:10:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:10:56,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:10:56,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:10:56,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:10:56,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:10:56,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:10:56,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:10:56,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:10:56,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:10:56,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:10:56,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:10:56,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:10:56,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:10:56,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:10:56,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:10:56,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:10:56,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:10:56,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:10:56,057 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:10:56,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:10:56,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:10:56,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:10:56,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:10:56,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:10:56,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:10:56,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:10:56,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:10:56,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:10:56,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:56,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:10:56,070 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:10:56,070 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:10:56,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:10:56,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:10:56,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:10:56,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:10:56,291 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:10:56,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-28 03:10:56,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ef47392/da688b5a39c24412861d5c79c2499357/FLAG5495ee2a8 [2022-04-28 03:10:56,706 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:10:56,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-28 03:10:56,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ef47392/da688b5a39c24412861d5c79c2499357/FLAG5495ee2a8 [2022-04-28 03:10:56,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ef47392/da688b5a39c24412861d5c79c2499357 [2022-04-28 03:10:56,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:10:56,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:10:56,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:56,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:10:56,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:10:56,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e37a507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56, skipping insertion in model container [2022-04-28 03:10:56,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:10:56,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:10:56,914 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/half_2.i[893,906] [2022-04-28 03:10:56,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:56,941 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:10:56,951 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/half_2.i[893,906] [2022-04-28 03:10:56,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:56,966 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:10:56,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56 WrapperNode [2022-04-28 03:10:56,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:56,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:10:56,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:10:56,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:10:56,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:56,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:10:56,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:10:56,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:10:56,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:10:56,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (1/1) ... [2022-04-28 03:10:57,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:57,019 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:10:57,026 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:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:10:57,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:10:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:10:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:10:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:10:57,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:10:57,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:10:57,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:10:57,235 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:10:57,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:10:57,239 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:10:57,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:57 BoogieIcfgContainer [2022-04-28 03:10:57,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:10:57,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:10:57,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:10:57,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:10:57,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:10:56" (1/3) ... [2022-04-28 03:10:57,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4347f715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:57, skipping insertion in model container [2022-04-28 03:10:57,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:56" (2/3) ... [2022-04-28 03:10:57,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4347f715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:57, skipping insertion in model container [2022-04-28 03:10:57,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:57" (3/3) ... [2022-04-28 03:10:57,246 INFO L111 eAbstractionObserver]: Analyzing ICFG half_2.i [2022-04-28 03:10:57,255 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:10:57,256 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:10:57,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:10:57,287 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@1285f6ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@648bd21d [2022-04-28 03:10:57,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:10:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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:10:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:10:57,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:57,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:57,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash 21938802, now seen corresponding path program 1 times [2022-04-28 03:10:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:57,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126622037] [2022-04-28 03:10:57,318 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash 21938802, now seen corresponding path program 2 times [2022-04-28 03:10:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:57,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601004016] [2022-04-28 03:10:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:57,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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); {26#true} is VALID [2022-04-28 03:10:57,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:10:57,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 03:10:57,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:57,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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); {26#true} is VALID [2022-04-28 03:10:57,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:10:57,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-28 03:10:57,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-28 03:10:57,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2022-04-28 03:10:57,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {31#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:10:57,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(<= main_~n~0 main_~k~0)} assume !(~i~0 < ~n~0); {31#(<= main_~n~0 main_~k~0)} is VALID [2022-04-28 03:10:57,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= main_~n~0 main_~k~0)} ~j~0 := 0; {32#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:10:57,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {33#(<= 1 main_~k~0)} is VALID [2022-04-28 03:10:57,670 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:10:57,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:10:57,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-28 03:10:57,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 03:10:57,671 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:10:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:57,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601004016] [2022-04-28 03:10:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601004016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:10:57,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:57,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126622037] [2022-04-28 03:10:57,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126622037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:57,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:57,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:10:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10727883] [2022-04-28 03:10:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:57,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:57,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:57,705 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:10:57,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:10:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:10:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:57,725 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:58,168 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 03:10:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:58,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 03:10:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 03:10:58,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-28 03:10:58,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:58,231 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:10:58,231 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:10:58,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:10:58,235 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:58,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:10:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:10:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 03:10:58,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:58,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:10:58,261 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:10:58,261 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:10:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:58,263 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:10:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:10:58,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:58,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:58,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-28 03:10:58,264 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 27 states. [2022-04-28 03:10:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:58,266 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:10:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:10:58,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:58,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:58,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:58,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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:10:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 03:10:58,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-04-28 03:10:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:58,269 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 03:10:58,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:10:58,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 03:10:58,293 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:10:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:10:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:10:58,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:58,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:58,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:10:58,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1438800602, now seen corresponding path program 1 times [2022-04-28 03:10:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934296012] [2022-04-28 03:10:58,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:10:58,605 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:10:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -781597209, now seen corresponding path program 1 times [2022-04-28 03:10:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:58,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360399278] [2022-04-28 03:10:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:58,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:58,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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); {257#true} is VALID [2022-04-28 03:10:58,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 03:10:58,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #68#return; {257#true} is VALID [2022-04-28 03:10:58,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:58,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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); {257#true} is VALID [2022-04-28 03:10:58,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 03:10:58,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #68#return; {257#true} is VALID [2022-04-28 03:10:58,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 03:10:58,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {257#true} is VALID [2022-04-28 03:10:58,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {262#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:10:58,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [72] L30-2-->L30-3_primed: Formula: (let ((.cse0 (= v_main_~k~0_10 v_main_~k~0_9)) (.cse1 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse2 (= v_main_~i~0_7 v_main_~i~0_6))) (or (and .cse0 .cse1 (not (< v_main_~i~0_7 v_main_~n~0_10)) .cse2) (and (< v_main_~k~0_10 (+ v_main_~k~0_9 (div (+ (- 1) v_main_~n~0_10 (* (- 1) v_main_~i~0_7)) 2) 2)) (< v_main_~k~0_9 v_main_~k~0_10) (= (+ v_main_~i~0_6 (* v_main_~k~0_9 2)) (+ v_main_~i~0_7 (* v_main_~k~0_10 2)))) (and .cse0 .cse1 (= v_main_~n~0_10 v_main_~n~0_10) .cse2))) InVars {main_~i~0=v_main_~i~0_7, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_10} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_9} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {263#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-28 03:10:58,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} [71] L30-3_primed-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {263#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-28 03:10:58,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} ~j~0 := 0; {264#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} is VALID [2022-04-28 03:10:58,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {264#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {265#(<= 1 main_~k~0)} is VALID [2022-04-28 03:10:58,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {265#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:10:58,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:10:58,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {258#false} is VALID [2022-04-28 03:10:58,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 03:10:58,748 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:10:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360399278] [2022-04-28 03:10:58,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360399278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:58,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:58,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:10:58,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:58,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934296012] [2022-04-28 03:10:58,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934296012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:58,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:58,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:10:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625415387] [2022-04-28 03:10:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 03:10:58,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:58,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:10:58,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:58,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:10:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:10:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:10:58,884 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:10:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:59,116 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:10:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:10:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 03:10:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:10:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-28 03:10:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:10:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-28 03:10:59,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 31 transitions. [2022-04-28 03:10:59,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:59,148 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:10:59,148 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:10:59,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:10:59,149 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:59,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-04-28 03:10:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:10:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-04-28 03:10:59,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:59,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 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:10:59,165 INFO L74 IsIncluded]: Start isIncluded. First operand 33 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:10:59,165 INFO L87 Difference]: Start difference. First operand 33 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:10:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:59,169 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:10:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:10:59,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:59,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:59,169 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 33 states. [2022-04-28 03:10:59,170 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 33 states. [2022-04-28 03:10:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:59,175 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:10:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:10:59,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:59,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:59,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:59,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:59,175 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:10:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-28 03:10:59,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2022-04-28 03:10:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:59,177 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-28 03:10:59,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:10:59,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-28 03:10:59,212 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:10:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-28 03:10:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:10:59,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:59,213 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:10:59,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:10:59,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1292947397, now seen corresponding path program 1 times [2022-04-28 03:10:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238412318] [2022-04-28 03:11:03,278 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:11:03,520 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:07,703 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:11:07,878 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:12,074 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:11:12,272 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:12,275 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:11:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -366181982, now seen corresponding path program 1 times [2022-04-28 03:11:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053092374] [2022-04-28 03:11:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(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); {469#true} is VALID [2022-04-28 03:11:12,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-28 03:11:12,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {469#true} {469#true} #68#return; {469#true} is VALID [2022-04-28 03:11:12,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:12,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#(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); {469#true} is VALID [2022-04-28 03:11:12,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-28 03:11:12,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #68#return; {469#true} is VALID [2022-04-28 03:11:12,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret5 := main(); {469#true} is VALID [2022-04-28 03:11:12,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {469#true} is VALID [2022-04-28 03:11:12,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {474#(and (= main_~i~0 0) (<= main_~k~0 main_~n~0))} is VALID [2022-04-28 03:11:12,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (= main_~i~0 0) (<= main_~k~0 main_~n~0))} assume !(~i~0 < ~n~0); {475#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:12,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} ~j~0 := 0; {476#(and (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:12,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(and (= main_~j~0 0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [74] L35-2-->L36_primed: Formula: (let ((.cse3 (= (mod v_main_~n~0_12 2) 0)) (.cse2 (< v_main_~n~0_12 0)) (.cse4 (div v_main_~n~0_12 2)) (.cse0 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse6 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< 0 v_main_~k~0_19)) .cse3 (not (< v_main_~j~0_7 (+ .cse4 1)))) .cse5 .cse6) (let ((.cse7 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (not .cse3) (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse7 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse7 (+ v_main_~k~0_18 2 .cse4)) (< 0 (+ v_main_~k~0_18 1)))) (and .cse0 .cse1 (= v_main_~n~0_12 v_main_~n~0_12) .cse5 .cse6))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:12,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} [75] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:12,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} [76] L35-2-->L36_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_7| |v_main_#t~post4_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse2 (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse4 (<= 0 v_main_~n~0_12)) (.cse3 (div v_main_~n~0_12 2))) (or (and .cse0 .cse1 .cse2 (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse3)) (not .cse4)) .cse5) (and .cse0 .cse1 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse5) (and .cse4 (< v_main_~j~0_7 v_main_~j~0_6) (= (+ v_main_~k~0_19 v_main_~j~0_7) (+ v_main_~k~0_18 v_main_~j~0_6)) (< v_main_~j~0_6 (+ v_main_~k~0_19 v_main_~j~0_7 1)) (< v_main_~j~0_6 (+ .cse3 1))))) InVars {main_#t~post4=|v_main_#t~post4_7|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_7|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:12,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} [77] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:12,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#(and (or (and (<= (div main_~n~0 2) 0) (<= main_~k~0 0)) (<= (+ main_~n~0 1) 0)) (= main_~j~0 0))} [78] L35-2-->L36_primed: Formula: (let ((.cse4 (div v_main_~n~0_12 2)) (.cse2 (= (mod v_main_~n~0_12 2) 0)) (.cse0 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse1 (= v_main_~k~0_19 v_main_~k~0_18))) (or (and (= |v_main_#t~post3_10| |v_main_#t~post3_3|) (= |v_main_#t~post4_10| |v_main_#t~post4_3|) .cse0 (= v_main_~n~0_12 v_main_~n~0_12) .cse1) (let ((.cse3 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse3 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse3 (+ v_main_~k~0_18 .cse4 1)) (< 0 (+ v_main_~k~0_18 1)))) (and (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse4)) (not .cse2)) (= |v_main_#t~post4_3| |v_main_#t~post4_10|) .cse0 .cse1 (= |v_main_#t~post3_3| |v_main_#t~post3_10|)))) InVars {main_#t~post4=|v_main_#t~post4_10|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_10|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {478#(and (or (<= (+ 2 (div main_~n~0 2)) main_~j~0) (= main_~j~0 0)) (or (and (<= (div main_~n~0 2) 0) (= main_~j~0 0)) (<= (+ main_~n~0 1) 0)))} is VALID [2022-04-28 03:11:12,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {478#(and (or (<= (+ 2 (div main_~n~0 2)) main_~j~0) (= main_~j~0 0)) (or (and (<= (div main_~n~0 2) 0) (= main_~j~0 0)) (<= (+ main_~n~0 1) 0)))} [73] L36_primed-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-28 03:11:12,532 INFO L272 TraceCheckUtils]: 15: Hoare triple {470#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {470#false} is VALID [2022-04-28 03:11:12,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {470#false} ~cond := #in~cond; {470#false} is VALID [2022-04-28 03:11:12,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {470#false} assume 0 == ~cond; {470#false} is VALID [2022-04-28 03:11:12,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-28 03:11:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:11:12,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053092374] [2022-04-28 03:11:12,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053092374] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:11:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925483000] [2022-04-28 03:11:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:12,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:11:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:12,540 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:12,543 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:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:11:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:12,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:11:13,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-28 03:11:13,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#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); {469#true} is VALID [2022-04-28 03:11:13,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-28 03:11:13,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #68#return; {469#true} is VALID [2022-04-28 03:11:13,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret5 := main(); {469#true} is VALID [2022-04-28 03:11:13,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {469#true} is VALID [2022-04-28 03:11:13,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {501#(and (<= main_~i~0 0) (<= main_~k~0 main_~n~0))} is VALID [2022-04-28 03:11:13,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(and (<= main_~i~0 0) (<= main_~k~0 main_~n~0))} assume !(~i~0 < ~n~0); {475#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} ~j~0 := 0; {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [74] L35-2-->L36_primed: Formula: (let ((.cse3 (= (mod v_main_~n~0_12 2) 0)) (.cse2 (< v_main_~n~0_12 0)) (.cse4 (div v_main_~n~0_12 2)) (.cse0 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse6 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< 0 v_main_~k~0_19)) .cse3 (not (< v_main_~j~0_7 (+ .cse4 1)))) .cse5 .cse6) (let ((.cse7 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (not .cse3) (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse7 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse7 (+ v_main_~k~0_18 2 .cse4)) (< 0 (+ v_main_~k~0_18 1)))) (and .cse0 .cse1 (= v_main_~n~0_12 v_main_~n~0_12) .cse5 .cse6))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [75] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [76] L35-2-->L36_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_7| |v_main_#t~post4_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse2 (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse4 (<= 0 v_main_~n~0_12)) (.cse3 (div v_main_~n~0_12 2))) (or (and .cse0 .cse1 .cse2 (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse3)) (not .cse4)) .cse5) (and .cse0 .cse1 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse5) (and .cse4 (< v_main_~j~0_7 v_main_~j~0_6) (= (+ v_main_~k~0_19 v_main_~j~0_7) (+ v_main_~k~0_18 v_main_~j~0_6)) (< v_main_~j~0_6 (+ v_main_~k~0_19 v_main_~j~0_7 1)) (< v_main_~j~0_6 (+ .cse3 1))))) InVars {main_#t~post4=|v_main_#t~post4_7|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_7|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [77] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#(and (<= 0 main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 0))} [78] L35-2-->L36_primed: Formula: (let ((.cse4 (div v_main_~n~0_12 2)) (.cse2 (= (mod v_main_~n~0_12 2) 0)) (.cse0 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse1 (= v_main_~k~0_19 v_main_~k~0_18))) (or (and (= |v_main_#t~post3_10| |v_main_#t~post3_3|) (= |v_main_#t~post4_10| |v_main_#t~post4_3|) .cse0 (= v_main_~n~0_12 v_main_~n~0_12) .cse1) (let ((.cse3 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse3 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse3 (+ v_main_~k~0_18 .cse4 1)) (< 0 (+ v_main_~k~0_18 1)))) (and (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse4)) (not .cse2)) (= |v_main_#t~post4_3| |v_main_#t~post4_10|) .cse0 .cse1 (= |v_main_#t~post3_3| |v_main_#t~post3_10|)))) InVars {main_#t~post4=|v_main_#t~post4_10|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_10|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {524#(and (<= 0 main_~j~0) (<= main_~n~0 0))} is VALID [2022-04-28 03:11:13,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(and (<= 0 main_~j~0) (<= main_~n~0 0))} [73] L36_primed-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-28 03:11:13,192 INFO L272 TraceCheckUtils]: 15: Hoare triple {470#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {470#false} is VALID [2022-04-28 03:11:13,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {470#false} ~cond := #in~cond; {470#false} is VALID [2022-04-28 03:11:13,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {470#false} assume 0 == ~cond; {470#false} is VALID [2022-04-28 03:11:13,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-28 03:11:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:11:13,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:11:14,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-28 03:11:14,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {470#false} assume 0 == ~cond; {470#false} is VALID [2022-04-28 03:11:14,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {470#false} ~cond := #in~cond; {470#false} is VALID [2022-04-28 03:11:14,048 INFO L272 TraceCheckUtils]: 15: Hoare triple {470#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {470#false} is VALID [2022-04-28 03:11:14,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [73] L36_primed-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-28 03:11:14,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [78] L35-2-->L36_primed: Formula: (let ((.cse4 (div v_main_~n~0_12 2)) (.cse2 (= (mod v_main_~n~0_12 2) 0)) (.cse0 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse1 (= v_main_~k~0_19 v_main_~k~0_18))) (or (and (= |v_main_#t~post3_10| |v_main_#t~post3_3|) (= |v_main_#t~post4_10| |v_main_#t~post4_3|) .cse0 (= v_main_~n~0_12 v_main_~n~0_12) .cse1) (let ((.cse3 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse3 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse3 (+ v_main_~k~0_18 .cse4 1)) (< 0 (+ v_main_~k~0_18 1)))) (and (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse4)) (not .cse2)) (= |v_main_#t~post4_3| |v_main_#t~post4_10|) .cse0 .cse1 (= |v_main_#t~post3_3| |v_main_#t~post3_10|)))) InVars {main_#t~post4=|v_main_#t~post4_10|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_10|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [77] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [76] L35-2-->L36_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_7| |v_main_#t~post4_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse2 (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse4 (<= 0 v_main_~n~0_12)) (.cse3 (div v_main_~n~0_12 2))) (or (and .cse0 .cse1 .cse2 (or (not (< 0 v_main_~k~0_19)) (not (< v_main_~j~0_7 .cse3)) (not .cse4)) .cse5) (and .cse0 .cse1 .cse2 (= v_main_~n~0_12 v_main_~n~0_12) .cse5) (and .cse4 (< v_main_~j~0_7 v_main_~j~0_6) (= (+ v_main_~k~0_19 v_main_~j~0_7) (+ v_main_~k~0_18 v_main_~j~0_6)) (< v_main_~j~0_6 (+ v_main_~k~0_19 v_main_~j~0_7 1)) (< v_main_~j~0_6 (+ .cse3 1))))) InVars {main_#t~post4=|v_main_#t~post4_7|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_7|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [75] L36_primed-->L35-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} [74] L35-2-->L36_primed: Formula: (let ((.cse3 (= (mod v_main_~n~0_12 2) 0)) (.cse2 (< v_main_~n~0_12 0)) (.cse4 (div v_main_~n~0_12 2)) (.cse0 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse1 (= v_main_~j~0_7 v_main_~j~0_6)) (.cse5 (= v_main_~k~0_19 v_main_~k~0_18)) (.cse6 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< 0 v_main_~k~0_19)) .cse3 (not (< v_main_~j~0_7 (+ .cse4 1)))) .cse5 .cse6) (let ((.cse7 (+ v_main_~k~0_19 v_main_~j~0_7))) (and (not .cse3) (< v_main_~k~0_18 v_main_~k~0_19) .cse2 (= .cse7 (+ v_main_~k~0_18 v_main_~j~0_6)) (< .cse7 (+ v_main_~k~0_18 2 .cse4)) (< 0 (+ v_main_~k~0_18 1)))) (and .cse0 .cse1 (= v_main_~n~0_12 v_main_~n~0_12) .cse5 .cse6))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~n~0=v_main_~n~0_12, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_19, main_~j~0=v_main_~j~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_12, main_~k~0=v_main_~k~0_18, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#(<= (div main_~n~0 2) 0)} ~j~0 := 0; {552#(and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0)))} is VALID [2022-04-28 03:11:14,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#(or (<= (div main_~n~0 2) 0) (< main_~i~0 main_~n~0))} assume !(~i~0 < ~n~0); {571#(<= (div main_~n~0 2) 0)} is VALID [2022-04-28 03:11:14,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {575#(or (<= (div main_~n~0 2) 0) (< main_~i~0 main_~n~0))} is VALID [2022-04-28 03:11:14,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {469#true} is VALID [2022-04-28 03:11:14,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret5 := main(); {469#true} is VALID [2022-04-28 03:11:14,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #68#return; {469#true} is VALID [2022-04-28 03:11:14,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-28 03:11:14,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#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); {469#true} is VALID [2022-04-28 03:11:14,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-28 03:11:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:11:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925483000] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:11:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:11:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 6] total 14 [2022-04-28 03:11:14,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:14,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238412318] [2022-04-28 03:11:14,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238412318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:14,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:14,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:11:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051855932] [2022-04-28 03:11:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 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:14,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:14,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:14,192 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:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:11:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:11:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:11:14,193 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:14,279 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:11:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:11:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 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:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 03:11:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 03:11:14,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 03:11:14,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:14,309 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:11:14,309 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:11:14,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:11:14,310 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:14,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:11:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:11:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:11:14,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:14,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,333 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,333 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:14,334 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 03:11:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:11:14,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:14,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:14,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,335 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:14,336 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-28 03:11:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:11:14,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:14,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:14,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:14,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 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:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 03:11:14,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-04-28 03:11:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:14,338 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 03:11:14,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:14,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 03:11:14,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 03:11:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:11:14,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:14,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:14,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:11:14,572 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:14,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 810760849, now seen corresponding path program 1 times [2022-04-28 03:11:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:14,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653526764] [2022-04-28 03:11:14,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:11:14,720 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:11:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash 869240240, now seen corresponding path program 1 times [2022-04-28 03:11:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:14,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086571629] [2022-04-28 03:11:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {800#(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); {783#true} is VALID [2022-04-28 03:11:14,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:14,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #68#return; {783#true} is VALID [2022-04-28 03:11:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 03:11:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:14,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-28 03:11:14,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-28 03:11:14,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:14,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} #66#return; {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:14,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:14,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {800#(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); {783#true} is VALID [2022-04-28 03:11:14,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:14,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #68#return; {783#true} is VALID [2022-04-28 03:11:14,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret5 := main(); {783#true} is VALID [2022-04-28 03:11:14,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {783#true} is VALID [2022-04-28 03:11:14,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {788#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:14,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [80] L30-2-->L30-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse1 (= v_main_~k~0_39 v_main_~k~0_38)) (.cse2 (= v_main_~i~0_15 v_main_~i~0_14))) (or (and (= (+ v_main_~i~0_14 (* v_main_~k~0_38 2)) (+ v_main_~i~0_15 (* v_main_~k~0_39 2))) (< v_main_~k~0_38 v_main_~k~0_39) (< v_main_~k~0_39 (+ v_main_~k~0_38 2 (div (+ (- 1) v_main_~n~0_16 (* v_main_~i~0_15 (- 1))) 2)))) (and (= v_main_~n~0_16 v_main_~n~0_16) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (< v_main_~i~0_15 v_main_~n~0_16)) .cse2))) InVars {main_~i~0=v_main_~i~0_15, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_39} OutVars{main_~i~0=v_main_~i~0_14, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_38} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:14,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} [79] L30-3_primed-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:14,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} ~j~0 := 0; {790#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:14,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {790#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:14,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {783#true} is VALID [2022-04-28 03:11:14,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-28 03:11:14,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-28 03:11:14,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:14,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {783#true} {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} #66#return; {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} is VALID [2022-04-28 03:11:14,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#(and (or (<= (div main_~n~0 2) 0) (<= (* 2 (div main_~n~0 2)) (+ main_~k~0 2)) (<= (div main_~n~0 2) main_~k~0)) (= main_~j~0 0))} #t~post3 := ~k~0;~k~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {796#(or (and (<= (* 2 (div main_~n~0 2)) (+ (* main_~j~0 2) main_~k~0 1)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (and (<= (+ (div main_~n~0 2) 1) main_~j~0) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ 2 (div main_~n~0 2)) main_~j~0) (<= (+ (div main_~n~0 2) 1) (+ main_~k~0 main_~j~0)) (and (<= (div main_~n~0 2) (+ main_~k~0 main_~j~0)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ (* 2 (div main_~n~0 2)) 1) (+ (* main_~j~0 2) main_~k~0)))} is VALID [2022-04-28 03:11:14,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#(or (and (<= (* 2 (div main_~n~0 2)) (+ (* main_~j~0 2) main_~k~0 1)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (and (<= (+ (div main_~n~0 2) 1) main_~j~0) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ 2 (div main_~n~0 2)) main_~j~0) (<= (+ (div main_~n~0 2) 1) (+ main_~k~0 main_~j~0)) (and (<= (div main_~n~0 2) (+ main_~k~0 main_~j~0)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ (* 2 (div main_~n~0 2)) 1) (+ (* main_~j~0 2) main_~k~0)))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {797#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:14,984 INFO L272 TraceCheckUtils]: 18: Hoare triple {797#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:14,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {798#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {799#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:14,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {784#false} is VALID [2022-04-28 03:11:14,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-28 03:11:14,985 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:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086571629] [2022-04-28 03:11:14,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086571629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:11:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405220629] [2022-04-28 03:11:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:11:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:14,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:11:14,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:11:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:15,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:11:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:15,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:11:16,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-28 03:11:16,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-28 03:11:16,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:16,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #68#return; {783#true} is VALID [2022-04-28 03:11:16,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret5 := main(); {783#true} is VALID [2022-04-28 03:11:16,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {783#true} is VALID [2022-04-28 03:11:16,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {788#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:16,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [80] L30-2-->L30-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse1 (= v_main_~k~0_39 v_main_~k~0_38)) (.cse2 (= v_main_~i~0_15 v_main_~i~0_14))) (or (and (= (+ v_main_~i~0_14 (* v_main_~k~0_38 2)) (+ v_main_~i~0_15 (* v_main_~k~0_39 2))) (< v_main_~k~0_38 v_main_~k~0_39) (< v_main_~k~0_39 (+ v_main_~k~0_38 2 (div (+ (- 1) v_main_~n~0_16 (* v_main_~i~0_15 (- 1))) 2)))) (and (= v_main_~n~0_16 v_main_~n~0_16) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (< v_main_~i~0_15 v_main_~n~0_16)) .cse2))) InVars {main_~i~0=v_main_~i~0_15, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_39} OutVars{main_~i~0=v_main_~i~0_14, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_38} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {825#(or (and (= main_~i~0 0) (<= main_~n~0 main_~k~0)) (and (< (div main_~i~0 2) (+ (div (+ (- 1) main_~n~0) 2) 2)) (= 0 (mod main_~i~0 2)) (< 0 (div main_~i~0 2)) (<= main_~n~0 (+ (div main_~i~0 2) main_~k~0))))} is VALID [2022-04-28 03:11:16,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {825#(or (and (= main_~i~0 0) (<= main_~n~0 main_~k~0)) (and (< (div main_~i~0 2) (+ (div (+ (- 1) main_~n~0) 2) 2)) (= 0 (mod main_~i~0 2)) (< 0 (div main_~i~0 2)) (<= main_~n~0 (+ (div main_~i~0 2) main_~k~0))))} [79] L30-3_primed-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:11:16,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0))} ~j~0 := 0; {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:16,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:16,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {783#true} is VALID [2022-04-28 03:11:16,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-28 03:11:16,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-28 03:11:16,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:16,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {783#true} {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} #66#return; {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:11:16,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= 0 main_~j~0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 main_~k~0)))} #t~post3 := ~k~0;~k~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {854#(and (<= 1 main_~j~0) (or (<= main_~n~0 (+ main_~k~0 1)) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) (+ main_~k~0 1))))} is VALID [2022-04-28 03:11:16,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {854#(and (<= 1 main_~j~0) (or (<= main_~n~0 (+ main_~k~0 1)) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) (+ main_~k~0 1))))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {797#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:16,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {797#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {861#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:11:16,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {865#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:11:16,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-28 03:11:16,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-28 03:11:16,056 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:16,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:11:16,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-28 03:11:16,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {865#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-28 03:11:16,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {865#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:11:16,776 INFO L272 TraceCheckUtils]: 18: Hoare triple {797#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {861#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:11:16,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {797#(<= 1 main_~k~0)} is VALID [2022-04-28 03:11:16,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} #t~post3 := ~k~0;~k~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {884#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} is VALID [2022-04-28 03:11:16,779 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {783#true} {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} #66#return; {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-28 03:11:16,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:16,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-28 03:11:16,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-28 03:11:16,779 INFO L272 TraceCheckUtils]: 11: Hoare triple {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {783#true} is VALID [2022-04-28 03:11:16,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-28 03:11:16,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {910#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} ~j~0 := 0; {888#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-28 03:11:16,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {914#(or (< main_~i~0 main_~n~0) (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} [79] L30-3_primed-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {910#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} is VALID [2022-04-28 03:11:16,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {918#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} [80] L30-2-->L30-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse1 (= v_main_~k~0_39 v_main_~k~0_38)) (.cse2 (= v_main_~i~0_15 v_main_~i~0_14))) (or (and (= (+ v_main_~i~0_14 (* v_main_~k~0_38 2)) (+ v_main_~i~0_15 (* v_main_~k~0_39 2))) (< v_main_~k~0_38 v_main_~k~0_39) (< v_main_~k~0_39 (+ v_main_~k~0_38 2 (div (+ (- 1) v_main_~n~0_16 (* v_main_~i~0_15 (- 1))) 2)))) (and (= v_main_~n~0_16 v_main_~n~0_16) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (< v_main_~i~0_15 v_main_~n~0_16)) .cse2))) InVars {main_~i~0=v_main_~i~0_15, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_39} OutVars{main_~i~0=v_main_~i~0_14, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_16, main_~k~0=v_main_~k~0_38} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {914#(or (< main_~i~0 main_~n~0) (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} is VALID [2022-04-28 03:11:16,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {918#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} is VALID [2022-04-28 03:11:16,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {783#true} is VALID [2022-04-28 03:11:16,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret5 := main(); {783#true} is VALID [2022-04-28 03:11:16,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #68#return; {783#true} is VALID [2022-04-28 03:11:16,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-28 03:11:16,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-28 03:11:16,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-28 03:11:16,797 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:16,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405220629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:11:16,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:11:16,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-04-28 03:11:16,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653526764] [2022-04-28 03:11:16,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653526764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:16,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:16,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:11:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744419286] [2022-04-28 03:11:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 22 [2022-04-28 03:11:16,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:16,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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:16,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:16,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:11:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:11:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:11:16,950 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,545 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:11:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:11:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 22 [2022-04-28 03:11:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2022-04-28 03:11:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2022-04-28 03:11:17,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 28 transitions. [2022-04-28 03:11:17,577 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:17,577 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:11:17,577 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:11:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:11:17,578 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:17,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:11:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:11:17,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:17,579 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:17,579 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:17,579 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:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,579 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:11:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:17,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:17,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:17,580 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:17,580 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:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:17,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:11:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:17,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:17,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:17,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:17,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:17,580 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:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:11:17,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-28 03:11:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:17,580 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:11:17,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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:17,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:11:17,581 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:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:11:17,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:17,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:11:17,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:11:17,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 03:11:17,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:11:18,547 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 03:11:18,547 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 03:11:18,547 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 03:11:18,547 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 03:11:18,548 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:18,548 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:18,548 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 03:11:18,548 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 39) the Hoare annotation is: (let ((.cse0 (div main_~n~0 2))) (let ((.cse3 (* 2 .cse0))) (let ((.cse1 (+ .cse0 1)) (.cse2 (+ main_~k~0 main_~j~0)) (.cse5 (or (<= 0 main_~n~0) (= .cse3 main_~n~0))) (.cse4 (* main_~j~0 2))) (or (and (= main_~j~0 0) (<= main_~n~0 0)) (<= (+ 2 .cse0) main_~j~0) (<= .cse1 .cse2) (and (<= .cse3 (+ .cse4 main_~k~0 1)) .cse5) (and (<= .cse1 main_~j~0) .cse5) (and (<= .cse0 .cse2) .cse5) (<= (+ .cse3 1) (+ .cse4 main_~k~0)))))) [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point L35-3(lines 35 39) the Hoare annotation is: true [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 41) the Hoare annotation is: true [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 41) the Hoare annotation is: true [2022-04-28 03:11:18,548 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~k~0) (let ((.cse1 (+ main_~k~0 main_~j~0)) (.cse0 (div main_~n~0 2))) (or (<= (+ .cse0 1) .cse1) (and (<= .cse0 .cse1) (or (<= 0 main_~n~0) (= (* 2 .cse0) main_~n~0)))))) [2022-04-28 03:11:18,548 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 1 main_~k~0) (let ((.cse1 (+ main_~k~0 main_~j~0)) (.cse0 (div main_~n~0 2))) (or (<= (+ .cse0 1) .cse1) (and (<= .cse0 .cse1) (or (<= 0 main_~n~0) (= (* 2 .cse0) main_~n~0)))))) [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 41) the Hoare annotation is: true [2022-04-28 03:11:18,548 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 33) the Hoare annotation is: (exists ((v_main_~k~0_14 Int)) (and (<= main_~n~0 v_main_~k~0_14) (let ((.cse0 (= main_~i~0 0)) (.cse1 (= v_main_~k~0_14 main_~k~0))) (or (and (< main_~k~0 v_main_~k~0_14) (= (+ (* main_~k~0 2) main_~i~0) (* v_main_~k~0_14 2)) (< v_main_~k~0_14 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2))) (and (not (< 0 main_~n~0)) .cse0 .cse1) (and .cse0 .cse1))))) [2022-04-28 03:11:18,548 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (and (<= (div main_~n~0 2) 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))) (and (or (and (<= main_~n~0 (+ main_~k~0 1)) (= main_~i~0 2)) (let ((.cse0 (div (+ (- 2) main_~i~0) 2))) (and (< 0 .cse0) (= 0 (mod main_~i~0 2)) (<= main_~n~0 (+ .cse0 main_~k~0 1))))) (< main_~i~0 (+ main_~n~0 2)))) [2022-04-28 03:11:18,548 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 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:18,549 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,549 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:18,549 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 03:11:18,549 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:18,549 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 03:11:18,549 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:18,549 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:18,551 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:18,552 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:11:18,554 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:18,554 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:18,557 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:11:18,558 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:11:18,558 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:18,558 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:18,567 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:11:18,581 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:11:18 BoogieIcfgContainer [2022-04-28 03:11:18,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:11:18,591 INFO L158 Benchmark]: Toolchain (without parser) took 21866.98ms. Allocated memory was 168.8MB in the beginning and 245.4MB in the end (delta: 76.5MB). Free memory was 117.1MB in the beginning and 104.3MB in the end (delta: 12.8MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,591 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:18,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.04ms. Allocated memory was 168.8MB in the beginning and 204.5MB in the end (delta: 35.7MB). Free memory was 116.8MB in the beginning and 179.0MB in the end (delta: -62.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,592 INFO L158 Benchmark]: Boogie Preprocessor took 27.02ms. Allocated memory is still 204.5MB. Free memory was 179.0MB in the beginning and 177.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,592 INFO L158 Benchmark]: RCFGBuilder took 244.74ms. Allocated memory is still 204.5MB. Free memory was 177.5MB in the beginning and 165.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,592 INFO L158 Benchmark]: TraceAbstraction took 21348.66ms. Allocated memory was 204.5MB in the beginning and 245.4MB in the end (delta: 40.9MB). Free memory was 165.0MB in the beginning and 104.3MB in the end (delta: 60.7MB). Peak memory consumption was 102.4MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,593 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.09ms. Allocated memory is still 168.8MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.04ms. Allocated memory was 168.8MB in the beginning and 204.5MB in the end (delta: 35.7MB). Free memory was 116.8MB in the beginning and 179.0MB in the end (delta: -62.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.02ms. Allocated memory is still 204.5MB. Free memory was 179.0MB in the beginning and 177.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.74ms. Allocated memory is still 204.5MB. Free memory was 177.5MB in the beginning and 165.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21348.66ms. Allocated memory was 204.5MB in the beginning and 245.4MB in the end (delta: 40.9MB). Free memory was 165.0MB in the beginning and 104.3MB in the end (delta: 60.7MB). Peak memory consumption was 102.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] * 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 24 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 294 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 66 mSDtfsCounter, 294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=1, InterpolantAutomatonStates: 37, 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, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 47 PreInvPairs, 72 NumberOfFragments, 318 HoareAnnotationTreeSize, 47 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 817 FormulaSimplificationTreeSizeReductionInter, 0.7s 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: 30]: Loop Invariant [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] [2022-04-28 03:11:18,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_14,QUANTIFIED] Derived loop invariant: (\exists v_main_~k~0_14 : int :: n <= v_main_~k~0_14 && ((((k < v_main_~k~0_14 && k * 2 + i == v_main_~k~0_14 * 2) && v_main_~k~0_14 < (-1 + n) / 2 + k + 2) || ((!(0 < n) && i == 0) && v_main_~k~0_14 == k)) || (i == 0 && v_main_~k~0_14 == k))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((j == 0 && n <= 0) || 2 + n / 2 <= j) || n / 2 + 1 <= k + j) || (2 * (n / 2) <= j * 2 + k + 1 && (0 <= n || 2 * (n / 2) == n))) || (n / 2 + 1 <= j && (0 <= n || 2 * (n / 2) == n))) || (n / 2 <= k + j && (0 <= n || 2 * (n / 2) == n))) || 2 * (n / 2) + 1 <= j * 2 + k - 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:18,621 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...