/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:42:26,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:42:26,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:42:26,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:42:26,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:42:26,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:42:26,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:42:26,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:42:26,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:42:26,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:42:26,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:42:26,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:42:26,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:42:26,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:42:26,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:42:26,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:42:26,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:42:26,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:42:26,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:42:26,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:42:26,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:42:26,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:42:26,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:42:26,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:42:26,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:42:26,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:42:26,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:42:26,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:42:26,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:42:26,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:42:26,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:42:26,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:42:26,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:42:26,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:42:26,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:42:26,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:42:26,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:42:26,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:42:26,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:42:26,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:42:26,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:42:26,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:42:26,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:42:26,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:42:26,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:42:26,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:42:26,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:42:26,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:42:26,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:42:26,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:42:26,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:42:26,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:26,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:42:26,539 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:42:26,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:42:26,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:42:26,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:42:26,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:42:26,694 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:42:26,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-28 02:42:26,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9d19652/ff1b8de9c160429f93bb49349b7b39fe/FLAGa1218a298 [2022-04-28 02:42:27,098 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:42:27,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-28 02:42:27,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9d19652/ff1b8de9c160429f93bb49349b7b39fe/FLAGa1218a298 [2022-04-28 02:42:27,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9d19652/ff1b8de9c160429f93bb49349b7b39fe [2022-04-28 02:42:27,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:27,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:27,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:27,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:27,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:27,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27, skipping insertion in model container [2022-04-28 02:42:27,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:27,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:27,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-28 02:42:27,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:27,274 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:27,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-28 02:42:27,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:27,295 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:27,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27 WrapperNode [2022-04-28 02:42:27,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:27,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:27,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:27,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:27,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:27,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:27,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:27,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:27,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (1/1) ... [2022-04-28 02:42:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:27,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:42:27,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:42:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:42:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:27,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:27,417 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:27,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:27,499 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:27,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:27,503 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:27,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:27 BoogieIcfgContainer [2022-04-28 02:42:27,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:27,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:27,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:27,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:27,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:27" (1/3) ... [2022-04-28 02:42:27,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4bc554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:27, skipping insertion in model container [2022-04-28 02:42:27,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:27" (2/3) ... [2022-04-28 02:42:27,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4bc554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:27, skipping insertion in model container [2022-04-28 02:42:27,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:27" (3/3) ... [2022-04-28 02:42:27,509 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2022-04-28 02:42:27,518 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:27,518 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:27,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:27,558 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@764186c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a368da8 [2022-04-28 02:42:27,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:42:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:42:27,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:27,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:27,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 1 times [2022-04-28 02:42:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040340252] [2022-04-28 02:42:27,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 2 times [2022-04-28 02:42:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:27,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092443669] [2022-04-28 02:42:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:27,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-28 02:42:27,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:27,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-28 02:42:27,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:27,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-28 02:42:27,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:27,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-28 02:42:27,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 02:42:27,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:27,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:27,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:27,766 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:27,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:27,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-28 02:42:27,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 02:42:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:27,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092443669] [2022-04-28 02:42:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092443669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:27,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040340252] [2022-04-28 02:42:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040340252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:27,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910790680] [2022-04-28 02:42:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:42:27,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:27,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:27,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:27,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:42:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:42:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:27,808 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,009 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 02:42:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:42:28,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:42:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 02:42:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 02:42:28,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-28 02:42:28,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:28,081 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:42:28,081 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:42:28,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:42:28,091 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:28,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:42:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:42:28,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:28,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,125 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,125 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,127 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:28,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:28,128 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 02:42:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,129 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:28,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:28,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 02:42:28,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 02:42:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:28,132 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 02:42:28,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 02:42:28,146 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 02:42:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 02:42:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:42:28,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:28,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:28,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:28,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 1 times [2022-04-28 02:42:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:28,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494747785] [2022-04-28 02:42:28,399 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 02:42:28,400 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2056142408, now seen corresponding path program 1 times [2022-04-28 02:42:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:28,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164271754] [2022-04-28 02:42:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {180#true} is VALID [2022-04-28 02:42:28,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 02:42:28,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-28 02:42:28,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:28,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {180#true} is VALID [2022-04-28 02:42:28,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 02:42:28,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-28 02:42:28,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret3 := main(); {180#true} is VALID [2022-04-28 02:42:28,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {185#(= main_~sn~0 0)} is VALID [2022-04-28 02:42:28,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:42:28,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [50] L25-3-->L25-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse1 (= v_main_~sn~0_7 v_main_~sn~0_6)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 .cse1 (not (<= v_main_~i~0_8 v_main_~n~0_8)) .cse2) (and .cse0 .cse1 .cse2 (= v_main_~n~0_8 v_main_~n~0_8)) (and (< v_main_~i~0_8 v_main_~i~0_7) (= (+ v_main_~sn~0_6 (* v_main_~i~0_8 2)) (+ v_main_~sn~0_7 (* v_main_~i~0_7 2))) (<= v_main_~i~0_7 (+ v_main_~n~0_8 1))))) InVars {main_~i~0=v_main_~i~0_8, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_6} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {187#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:42:28,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [49] L25-4_primed-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {188#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:28,594 INFO L272 TraceCheckUtils]: 9: Hoare triple {188#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {189#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:28,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {190#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:28,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-28 02:42:28,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 02:42:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:28,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164271754] [2022-04-28 02:42:28,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164271754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:28,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:28,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:42:28,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:28,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494747785] [2022-04-28 02:42:28,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494747785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:28,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:28,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:42:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927290923] [2022-04-28 02:42:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:42:28,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:28,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,735 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 02:42:28,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:42:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:42:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:42:28,736 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,952 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 02:42:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:42:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:42:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2022-04-28 02:42:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2022-04-28 02:42:28,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 15 transitions. [2022-04-28 02:42:28,966 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 02:42:28,967 INFO L225 Difference]: With dead ends: 15 [2022-04-28 02:42:28,967 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:42:28,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:42:28,968 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:28,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:42:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:42:28,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:28,969 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 02:42:28,969 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 02:42:28,969 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 02:42:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:42:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:28,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,970 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 02:42:28,970 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 02:42:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:28,970 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:42:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:28,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:28,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:28,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:28,971 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 02:42:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:42:28,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 02:42:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:28,971 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:42:28,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:28,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 02:42:28,971 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 02:42:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:42:28,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:28,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:42:28,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:42:28,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:42:29,060 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 02:42:29,060 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 02:42:29,061 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 02:42:29,061 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 29) the Hoare annotation is: true [2022-04-28 02:42:29,061 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 29) the Hoare annotation is: true [2022-04-28 02:42:29,061 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (= main_~sn~0 0) [2022-04-28 02:42:29,061 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (and (or (and (= main_~sn~0 (* main_~i~0 2)) (< 1 main_~i~0)) (and (= main_~i~0 1) (= (+ (- 2) main_~sn~0) 0))) (<= main_~i~0 main_~n~0)) [2022-04-28 02:42:29,061 INFO L895 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (or (and (< 2 main_~i~0) (= (+ 2 main_~sn~0) (* main_~i~0 2))) (and (= main_~i~0 2) (= 2 main_~sn~0))))) [2022-04-28 02:42:29,061 INFO L895 garLoopResultBuilder]: At program point L25-4(lines 25 27) the Hoare annotation is: (or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0)) [2022-04-28 02:42:29,061 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 29) the Hoare annotation is: true [2022-04-28 02:42:29,061 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 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 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L895 garLoopResultBuilder]: At program point L17(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:42:29,062 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 02:42:29,062 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 20) the Hoare annotation is: true [2022-04-28 02:42:29,062 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 15 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 02:42:29,062 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 02:42:29,063 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 02:42:29,064 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-28 02:42:29,066 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:42:29,068 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:42:29,068 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:42:29,069 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 02:42:29,075 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:42:29,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:42:29 BoogieIcfgContainer [2022-04-28 02:42:29,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:42:29,081 INFO L158 Benchmark]: Toolchain (without parser) took 1969.22ms. Allocated memory was 188.7MB in the beginning and 267.4MB in the end (delta: 78.6MB). Free memory was 131.5MB in the beginning and 172.0MB in the end (delta: -40.5MB). Peak memory consumption was 38.7MB. Max. memory is 8.0GB. [2022-04-28 02:42:29,082 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:42:29,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.56ms. Allocated memory was 188.7MB in the beginning and 267.4MB in the end (delta: 78.6MB). Free memory was 131.2MB in the beginning and 237.3MB in the end (delta: -106.1MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-04-28 02:42:29,082 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 267.4MB. Free memory was 237.3MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:29,082 INFO L158 Benchmark]: RCFGBuilder took 181.03ms. Allocated memory is still 267.4MB. Free memory was 235.8MB in the beginning and 225.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:42:29,083 INFO L158 Benchmark]: TraceAbstraction took 1575.22ms. Allocated memory is still 267.4MB. Free memory was 224.8MB in the beginning and 172.0MB in the end (delta: 52.8MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. [2022-04-28 02:42:29,084 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 188.7MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.56ms. Allocated memory was 188.7MB in the beginning and 267.4MB in the end (delta: 78.6MB). Free memory was 131.2MB in the beginning and 237.3MB in the end (delta: -106.1MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 267.4MB. Free memory was 237.3MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 181.03ms. Allocated memory is still 267.4MB. Free memory was 235.8MB in the beginning and 225.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1575.22ms. Allocated memory is still 267.4MB. Free memory was 224.8MB in the beginning and 172.0MB in the end (delta: 52.8MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 22 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 45 NumberOfFragments, 115 HoareAnnotationTreeSize, 32 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 65 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 25]: Loop Invariant Derived loop invariant: (sn == 0 && i == 1) || (i <= n + 1 && ((2 < i && 2 + sn == i * 2) || (i == 2 && 2 == sn))) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: 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 02:42:29,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...