/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/s12iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:24,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:24,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:24,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:24,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:24,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:24,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:24,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:24,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:24,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:24,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:24,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:24,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:24,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:24,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:24,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:24,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:24,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:24,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:24,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:24,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:24,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:24,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:24,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:24,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:24,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:24,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:24,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:24,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:24,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:24,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:24,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:24,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:24,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:24,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:24,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:24,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:24,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:24,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:24,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:24,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:24,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:24,298 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:24,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:24,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:24,300 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:24,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:24,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:24,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:24,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:24,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:24,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:24,302 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:24,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:24,302 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:24,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:24,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:24,303 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:24,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:24,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:24,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:24,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:24,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:24,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:24,307 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:24,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:24,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:24,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:24,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:24,650 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:24,651 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s12iff.c [2020-07-10 20:21:24,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e297fe31/efc7a6a5c40f42c89fb677baa17e7440/FLAG59875ce3c [2020-07-10 20:21:25,145 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:25,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s12iff.c [2020-07-10 20:21:25,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e297fe31/efc7a6a5c40f42c89fb677baa17e7440/FLAG59875ce3c [2020-07-10 20:21:25,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e297fe31/efc7a6a5c40f42c89fb677baa17e7440 [2020-07-10 20:21:25,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:25,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:25,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:25,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:25,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:25,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580f007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25, skipping insertion in model container [2020-07-10 20:21:25,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:25,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:25,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:25,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:25,805 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:25,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:25,850 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:25,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25 WrapperNode [2020-07-10 20:21:25,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:25,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:25,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:25,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:26,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... [2020-07-10 20:21:26,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:26,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:26,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:26,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:26,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:26,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:26,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:26,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:26,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:26,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:26,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:26,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:26,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:26,604 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:26,604 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:21:26,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:26 BoogieIcfgContainer [2020-07-10 20:21:26,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:26,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:26,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:26,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:26,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:25" (1/3) ... [2020-07-10 20:21:26,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:26, skipping insertion in model container [2020-07-10 20:21:26,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:25" (2/3) ... [2020-07-10 20:21:26,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:26, skipping insertion in model container [2020-07-10 20:21:26,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:26" (3/3) ... [2020-07-10 20:21:26,618 INFO L109 eAbstractionObserver]: Analyzing ICFG s12iff.c [2020-07-10 20:21:26,629 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:26,637 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:26,652 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:26,676 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:26,676 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:26,676 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:26,677 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:26,677 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:26,677 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:26,677 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:26,678 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-07-10 20:21:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:26,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:26,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:26,710 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 350973390, now seen corresponding path program 1 times [2020-07-10 20:21:26,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:26,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026964318] [2020-07-10 20:21:26,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:27,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {83#true} is VALID [2020-07-10 20:21:27,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {83#true} #valid := #valid[0 := 0]; {83#true} is VALID [2020-07-10 20:21:27,036 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} assume 0 < #StackHeapBarrier; {83#true} is VALID [2020-07-10 20:21:27,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#true} ~N~0 := 0; {83#true} is VALID [2020-07-10 20:21:27,037 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-10 20:21:27,038 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {83#true} {83#true} #135#return; {83#true} is VALID [2020-07-10 20:21:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:27,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {83#true} ~cond := #in~cond; {83#true} is VALID [2020-07-10 20:21:27,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {83#true} assume !(0 == ~cond); {83#true} is VALID [2020-07-10 20:21:27,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-10 20:21:27,050 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} #131#return; {83#true} is VALID [2020-07-10 20:21:27,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {83#true} call ULTIMATE.init(); {95#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:27,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {83#true} is VALID [2020-07-10 20:21:27,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} #valid := #valid[0 := 0]; {83#true} is VALID [2020-07-10 20:21:27,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#true} assume 0 < #StackHeapBarrier; {83#true} is VALID [2020-07-10 20:21:27,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#true} ~N~0 := 0; {83#true} is VALID [2020-07-10 20:21:27,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-10 20:21:27,055 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {83#true} {83#true} #135#return; {83#true} is VALID [2020-07-10 20:21:27,055 INFO L263 TraceCheckUtils]: 7: Hoare triple {83#true} call #t~ret14 := main(); {83#true} is VALID [2020-07-10 20:21:27,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83#true} is VALID [2020-07-10 20:21:27,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {83#true} ~N~0 := #t~nondet0; {83#true} is VALID [2020-07-10 20:21:27,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {83#true} havoc #t~nondet0; {83#true} is VALID [2020-07-10 20:21:27,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {83#true} assume !(~N~0 <= 0); {83#true} is VALID [2020-07-10 20:21:27,057 INFO L263 TraceCheckUtils]: 12: Hoare triple {83#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {83#true} is VALID [2020-07-10 20:21:27,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {83#true} ~cond := #in~cond; {83#true} is VALID [2020-07-10 20:21:27,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#true} assume !(0 == ~cond); {83#true} is VALID [2020-07-10 20:21:27,058 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-10 20:21:27,059 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {83#true} {83#true} #131#return; {83#true} is VALID [2020-07-10 20:21:27,059 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#true} havoc ~i~0; {83#true} is VALID [2020-07-10 20:21:27,060 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {83#true} is VALID [2020-07-10 20:21:27,060 INFO L280 TraceCheckUtils]: 19: Hoare triple {83#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {83#true} is VALID [2020-07-10 20:21:27,061 INFO L280 TraceCheckUtils]: 20: Hoare triple {83#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {83#true} is VALID [2020-07-10 20:21:27,061 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {83#true} is VALID [2020-07-10 20:21:27,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#true} ~i~0 := 0; {83#true} is VALID [2020-07-10 20:21:27,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#true} assume !true; {84#false} is VALID [2020-07-10 20:21:27,063 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#false} ~i~0 := 0; {84#false} is VALID [2020-07-10 20:21:27,064 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#false} assume !true; {84#false} is VALID [2020-07-10 20:21:27,064 INFO L280 TraceCheckUtils]: 26: Hoare triple {84#false} ~i~0 := 0; {84#false} is VALID [2020-07-10 20:21:27,064 INFO L280 TraceCheckUtils]: 27: Hoare triple {84#false} assume !true; {84#false} is VALID [2020-07-10 20:21:27,065 INFO L280 TraceCheckUtils]: 28: Hoare triple {84#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {84#false} is VALID [2020-07-10 20:21:27,065 INFO L263 TraceCheckUtils]: 29: Hoare triple {84#false} call __VERIFIER_assert((if #t~mem13 == 2 * ~N~0 then 1 else 0)); {84#false} is VALID [2020-07-10 20:21:27,066 INFO L280 TraceCheckUtils]: 30: Hoare triple {84#false} ~cond := #in~cond; {84#false} is VALID [2020-07-10 20:21:27,066 INFO L280 TraceCheckUtils]: 31: Hoare triple {84#false} assume 0 == ~cond; {84#false} is VALID [2020-07-10 20:21:27,066 INFO L280 TraceCheckUtils]: 32: Hoare triple {84#false} assume !false; {84#false} is VALID [2020-07-10 20:21:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:27,072 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:27,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026964318] [2020-07-10 20:21:27,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:27,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:27,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59969183] [2020-07-10 20:21:27,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:27,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:27,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:27,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:27,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:27,162 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2020-07-10 20:21:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,719 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2020-07-10 20:21:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:27,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 20:21:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 20:21:27,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-10 20:21:27,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:28,004 INFO L225 Difference]: With dead ends: 143 [2020-07-10 20:21:28,005 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 20:21:28,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 20:21:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-10 20:21:28,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:28,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-10 20:21:28,118 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 20:21:28,119 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 20:21:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:28,125 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 20:21:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 20:21:28,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:28,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:28,127 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 20:21:28,127 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 20:21:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:28,133 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 20:21:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 20:21:28,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:28,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:28,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:28,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 20:21:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-10 20:21:28,141 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2020-07-10 20:21:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:28,141 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-10 20:21:28,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:28,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2020-07-10 20:21:28,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 20:21:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:28,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:28,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:28,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:28,225 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1688115303, now seen corresponding path program 1 times [2020-07-10 20:21:28,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:28,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449090449] [2020-07-10 20:21:28,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {670#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {656#true} is VALID [2020-07-10 20:21:28,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} #valid := #valid[0 := 0]; {656#true} is VALID [2020-07-10 20:21:28,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume 0 < #StackHeapBarrier; {656#true} is VALID [2020-07-10 20:21:28,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} ~N~0 := 0; {656#true} is VALID [2020-07-10 20:21:28,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:21:28,389 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {656#true} {656#true} #135#return; {656#true} is VALID [2020-07-10 20:21:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:28,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {656#true} ~cond := #in~cond; {656#true} is VALID [2020-07-10 20:21:28,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} assume !(0 == ~cond); {656#true} is VALID [2020-07-10 20:21:28,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:21:28,400 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {656#true} {664#(<= 1 ~N~0)} #131#return; {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,402 INFO L263 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {670#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:21:28,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {670#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {656#true} is VALID [2020-07-10 20:21:28,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} #valid := #valid[0 := 0]; {656#true} is VALID [2020-07-10 20:21:28,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} assume 0 < #StackHeapBarrier; {656#true} is VALID [2020-07-10 20:21:28,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {656#true} ~N~0 := 0; {656#true} is VALID [2020-07-10 20:21:28,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:21:28,404 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {656#true} {656#true} #135#return; {656#true} is VALID [2020-07-10 20:21:28,405 INFO L263 TraceCheckUtils]: 7: Hoare triple {656#true} call #t~ret14 := main(); {656#true} is VALID [2020-07-10 20:21:28,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {656#true} is VALID [2020-07-10 20:21:28,406 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#true} ~N~0 := #t~nondet0; {656#true} is VALID [2020-07-10 20:21:28,406 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#true} havoc #t~nondet0; {656#true} is VALID [2020-07-10 20:21:28,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {656#true} assume !(~N~0 <= 0); {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,412 INFO L263 TraceCheckUtils]: 12: Hoare triple {664#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {656#true} is VALID [2020-07-10 20:21:28,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {656#true} ~cond := #in~cond; {656#true} is VALID [2020-07-10 20:21:28,413 INFO L280 TraceCheckUtils]: 14: Hoare triple {656#true} assume !(0 == ~cond); {656#true} is VALID [2020-07-10 20:21:28,413 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-10 20:21:28,415 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {656#true} {664#(<= 1 ~N~0)} #131#return; {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {664#(<= 1 ~N~0)} havoc ~i~0; {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,417 INFO L280 TraceCheckUtils]: 19: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {664#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,419 INFO L280 TraceCheckUtils]: 21: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {664#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:28,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {664#(<= 1 ~N~0)} ~i~0 := 0; {669#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:28,421 INFO L280 TraceCheckUtils]: 23: Hoare triple {669#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-10 20:21:28,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {657#false} ~i~0 := 0; {657#false} is VALID [2020-07-10 20:21:28,422 INFO L280 TraceCheckUtils]: 25: Hoare triple {657#false} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-10 20:21:28,422 INFO L280 TraceCheckUtils]: 26: Hoare triple {657#false} ~i~0 := 0; {657#false} is VALID [2020-07-10 20:21:28,423 INFO L280 TraceCheckUtils]: 27: Hoare triple {657#false} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-10 20:21:28,423 INFO L280 TraceCheckUtils]: 28: Hoare triple {657#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {657#false} is VALID [2020-07-10 20:21:28,423 INFO L263 TraceCheckUtils]: 29: Hoare triple {657#false} call __VERIFIER_assert((if #t~mem13 == 2 * ~N~0 then 1 else 0)); {657#false} is VALID [2020-07-10 20:21:28,424 INFO L280 TraceCheckUtils]: 30: Hoare triple {657#false} ~cond := #in~cond; {657#false} is VALID [2020-07-10 20:21:28,424 INFO L280 TraceCheckUtils]: 31: Hoare triple {657#false} assume 0 == ~cond; {657#false} is VALID [2020-07-10 20:21:28,424 INFO L280 TraceCheckUtils]: 32: Hoare triple {657#false} assume !false; {657#false} is VALID [2020-07-10 20:21:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:28,428 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:28,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449090449] [2020-07-10 20:21:28,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:28,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:28,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52307120] [2020-07-10 20:21:28,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:28,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:28,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:28,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:28,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:28,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:28,490 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2020-07-10 20:21:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,121 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2020-07-10 20:21:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:29,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-10 20:21:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-10 20:21:29,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2020-07-10 20:21:29,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:29,341 INFO L225 Difference]: With dead ends: 142 [2020-07-10 20:21:29,342 INFO L226 Difference]: Without dead ends: 102 [2020-07-10 20:21:29,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:21:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-10 20:21:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2020-07-10 20:21:29,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:29,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 71 states. [2020-07-10 20:21:29,476 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 71 states. [2020-07-10 20:21:29,476 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 71 states. [2020-07-10 20:21:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,481 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2020-07-10 20:21:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-10 20:21:29,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:29,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:29,483 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 102 states. [2020-07-10 20:21:29,483 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 102 states. [2020-07-10 20:21:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:29,488 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2020-07-10 20:21:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-10 20:21:29,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:29,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:29,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:29,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-10 20:21:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-07-10 20:21:29,494 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 33 [2020-07-10 20:21:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:29,494 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-07-10 20:21:29,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:29,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2020-07-10 20:21:29,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2020-07-10 20:21:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 20:21:29,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:29,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:29,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:29,604 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1790069826, now seen corresponding path program 1 times [2020-07-10 20:21:29,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:29,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890315629] [2020-07-10 20:21:29,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:29,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:29,644 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 20:21:29,650 INFO L168 Benchmark]: Toolchain (without parser) took 4113.84 ms. Allocated memory was 146.3 MB in the beginning and 243.3 MB in the end (delta: 97.0 MB). Free memory was 104.7 MB in the beginning and 161.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,651 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.83 ms. Allocated memory is still 146.3 MB. Free memory was 104.3 MB in the beginning and 92.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,653 INFO L168 Benchmark]: Boogie Preprocessor took 213.37 ms. Allocated memory was 146.3 MB in the beginning and 207.6 MB in the end (delta: 61.3 MB). Free memory was 92.7 MB in the beginning and 184.8 MB in the end (delta: -92.1 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,654 INFO L168 Benchmark]: RCFGBuilder took 543.62 ms. Allocated memory is still 207.6 MB. Free memory was 184.8 MB in the beginning and 151.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,655 INFO L168 Benchmark]: TraceAbstraction took 3036.33 ms. Allocated memory was 207.6 MB in the beginning and 243.3 MB in the end (delta: 35.7 MB). Free memory was 150.9 MB in the beginning and 161.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:29,659 INFO L336 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.83 ms. Allocated memory is still 146.3 MB. Free memory was 104.3 MB in the beginning and 92.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.37 ms. Allocated memory was 146.3 MB in the beginning and 207.6 MB in the end (delta: 61.3 MB). Free memory was 92.7 MB in the beginning and 184.8 MB in the end (delta: -92.1 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 543.62 ms. Allocated memory is still 207.6 MB. Free memory was 184.8 MB in the beginning and 151.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3036.33 ms. Allocated memory was 207.6 MB in the beginning and 243.3 MB in the end (delta: 35.7 MB). Free memory was 150.9 MB in the beginning and 161.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...