/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/res1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:22,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:22,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:22,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:22,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:22,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:22,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:22,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:22,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:22,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:22,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:22,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:22,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:22,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:22,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:22,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:22,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:22,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:22,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:22,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:22,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:22,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:22,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:22,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:22,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:22,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:22,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:22,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:22,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:22,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:22,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:22,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:22,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:22,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:22,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:22,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:22,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:22,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:22,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:22,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:22,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:22,458 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:22,468 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:22,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:22,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:22,471 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:22,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:22,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:22,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:22,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:22,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:22,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:22,473 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:22,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:22,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:22,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:22,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:22,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:22,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:22,474 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:22,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:22,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:22,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:22,808 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:22,809 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:22,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res1f.c [2020-07-10 20:21:22,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08846abc6/8fb5c0ac795c4b0a9e724cf1ed5017ca/FLAG26d11faa3 [2020-07-10 20:21:23,450 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:23,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res1f.c [2020-07-10 20:21:23,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08846abc6/8fb5c0ac795c4b0a9e724cf1ed5017ca/FLAG26d11faa3 [2020-07-10 20:21:23,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08846abc6/8fb5c0ac795c4b0a9e724cf1ed5017ca [2020-07-10 20:21:23,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:23,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:23,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:23,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:23,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:23,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:23" (1/1) ... [2020-07-10 20:21:23,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225b46a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:23, skipping insertion in model container [2020-07-10 20:21:23,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:23" (1/1) ... [2020-07-10 20:21:23,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:23,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:24,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:24,116 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:24,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:24,166 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:24,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:24 WrapperNode [2020-07-10 20:21:24,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:24,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:24,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:24,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:24,280 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:24" (1/1) ... [2020-07-10 20:21:24,281 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:24" (1/1) ... [2020-07-10 20:21:24,289 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:24" (1/1) ... [2020-07-10 20:21:24,290 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:24" (1/1) ... [2020-07-10 20:21:24,303 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:24" (1/1) ... [2020-07-10 20:21:24,313 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:24" (1/1) ... [2020-07-10 20:21:24,317 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:24" (1/1) ... [2020-07-10 20:21:24,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:24,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:24,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:24,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:24,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:24" (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:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:24,967 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:24,967 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 20:21:24,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:24 BoogieIcfgContainer [2020-07-10 20:21:24,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:24,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:24,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:24,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:24,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:23" (1/3) ... [2020-07-10 20:21:24,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3059ffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:24, skipping insertion in model container [2020-07-10 20:21:24,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:24" (2/3) ... [2020-07-10 20:21:24,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3059ffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:24, skipping insertion in model container [2020-07-10 20:21:24,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:24" (3/3) ... [2020-07-10 20:21:24,980 INFO L109 eAbstractionObserver]: Analyzing ICFG res1f.c [2020-07-10 20:21:24,991 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:24,998 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:25,010 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:25,028 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:25,028 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:25,028 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:25,029 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:25,029 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:25,029 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:25,030 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:25,030 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-10 20:21:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:25,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:25,058 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] [2020-07-10 20:21:25,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1226656927, now seen corresponding path program 1 times [2020-07-10 20:21:25,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:25,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [603980273] [2020-07-10 20:21:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:25,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(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; {77#true} is VALID [2020-07-10 20:21:25,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} #valid := #valid[0 := 0]; {77#true} is VALID [2020-07-10 20:21:25,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-10 20:21:25,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#true} ~N~0 := 0; {77#true} is VALID [2020-07-10 20:21:25,330 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:21:25,331 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {77#true} {77#true} #132#return; {77#true} is VALID [2020-07-10 20:21:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:25,342 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} ~cond := #in~cond; {77#true} is VALID [2020-07-10 20:21:25,343 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume !(0 == ~cond); {77#true} is VALID [2020-07-10 20:21:25,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:21:25,344 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {77#true} {77#true} #128#return; {77#true} is VALID [2020-07-10 20:21:25,346 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {89#(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:25,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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; {77#true} is VALID [2020-07-10 20:21:25,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} #valid := #valid[0 := 0]; {77#true} is VALID [2020-07-10 20:21:25,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#true} assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-10 20:21:25,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} ~N~0 := 0; {77#true} is VALID [2020-07-10 20:21:25,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:21:25,348 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#true} {77#true} #132#return; {77#true} is VALID [2020-07-10 20:21:25,349 INFO L263 TraceCheckUtils]: 7: Hoare triple {77#true} call #t~ret12 := main(); {77#true} is VALID [2020-07-10 20:21:25,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID [2020-07-10 20:21:25,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} ~N~0 := #t~nondet0; {77#true} is VALID [2020-07-10 20:21:25,350 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID [2020-07-10 20:21:25,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} assume !(~N~0 <= 0); {77#true} is VALID [2020-07-10 20:21:25,351 INFO L263 TraceCheckUtils]: 12: Hoare triple {77#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {77#true} is VALID [2020-07-10 20:21:25,351 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} ~cond := #in~cond; {77#true} is VALID [2020-07-10 20:21:25,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} assume !(0 == ~cond); {77#true} is VALID [2020-07-10 20:21:25,352 INFO L280 TraceCheckUtils]: 15: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-10 20:21:25,353 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {77#true} {77#true} #128#return; {77#true} is VALID [2020-07-10 20:21:25,353 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#true} havoc ~i~0; {77#true} is VALID [2020-07-10 20:21:25,353 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {77#true} is VALID [2020-07-10 20:21:25,354 INFO L280 TraceCheckUtils]: 19: Hoare triple {77#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {77#true} is VALID [2020-07-10 20:21:25,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {77#true} is VALID [2020-07-10 20:21:25,355 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {77#true} is VALID [2020-07-10 20:21:25,355 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {77#true} is VALID [2020-07-10 20:21:25,356 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {77#true} is VALID [2020-07-10 20:21:25,356 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#true} ~i~0 := 0; {77#true} is VALID [2020-07-10 20:21:25,357 INFO L280 TraceCheckUtils]: 25: Hoare triple {77#true} assume !true; {78#false} is VALID [2020-07-10 20:21:25,358 INFO L280 TraceCheckUtils]: 26: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-10 20:21:25,358 INFO L280 TraceCheckUtils]: 27: Hoare triple {78#false} assume !(~i~0 < ~N~0); {78#false} is VALID [2020-07-10 20:21:25,359 INFO L280 TraceCheckUtils]: 28: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-10 20:21:25,359 INFO L280 TraceCheckUtils]: 29: Hoare triple {78#false} assume !(~i~0 < ~N~0); {78#false} is VALID [2020-07-10 20:21:25,360 INFO L280 TraceCheckUtils]: 30: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-10 20:21:25,360 INFO L280 TraceCheckUtils]: 31: Hoare triple {78#false} assume !true; {78#false} is VALID [2020-07-10 20:21:25,360 INFO L280 TraceCheckUtils]: 32: Hoare triple {78#false} SUMMARY for call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {78#false} is VALID [2020-07-10 20:21:25,361 INFO L263 TraceCheckUtils]: 33: Hoare triple {78#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {78#false} is VALID [2020-07-10 20:21:25,361 INFO L280 TraceCheckUtils]: 34: Hoare triple {78#false} ~cond := #in~cond; {78#false} is VALID [2020-07-10 20:21:25,362 INFO L280 TraceCheckUtils]: 35: Hoare triple {78#false} assume 0 == ~cond; {78#false} is VALID [2020-07-10 20:21:25,362 INFO L280 TraceCheckUtils]: 36: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-10 20:21:25,368 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:25,368 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:25,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [603980273] [2020-07-10 20:21:25,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:25,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:25,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608258035] [2020-07-10 20:21:25,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:25,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:25,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:25,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:25,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:25,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:25,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:25,466 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-07-10 20:21:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:25,948 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2020-07-10 20:21:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:25,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-10 20:21:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 20:21:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 20:21:25,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-10 20:21:26,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:26,237 INFO L225 Difference]: With dead ends: 131 [2020-07-10 20:21:26,237 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 20:21:26,246 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:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 20:21:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-10 20:21:26,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:26,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:26,388 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:26,388 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:26,398 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-10 20:21:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:26,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:26,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:26,400 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:26,400 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:26,414 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-10 20:21:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:26,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:26,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:26,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:26,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 20:21:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-10 20:21:26,423 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 37 [2020-07-10 20:21:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:26,424 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-10 20:21:26,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:26,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-10 20:21:26,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:21:26,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:26,511 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] [2020-07-10 20:21:26,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:26,512 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1534386935, now seen corresponding path program 1 times [2020-07-10 20:21:26,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:26,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [258977890] [2020-07-10 20:21:26,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {616#(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; {602#true} is VALID [2020-07-10 20:21:26,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} #valid := #valid[0 := 0]; {602#true} is VALID [2020-07-10 20:21:26,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} assume 0 < #StackHeapBarrier; {602#true} is VALID [2020-07-10 20:21:26,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {602#true} ~N~0 := 0; {602#true} is VALID [2020-07-10 20:21:26,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 20:21:26,680 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {602#true} {602#true} #132#return; {602#true} is VALID [2020-07-10 20:21:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:26,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {602#true} ~cond := #in~cond; {602#true} is VALID [2020-07-10 20:21:26,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} assume !(0 == ~cond); {602#true} is VALID [2020-07-10 20:21:26,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 20:21:26,691 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {602#true} {610#(<= 1 ~N~0)} #128#return; {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {616#(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:26,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#(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; {602#true} is VALID [2020-07-10 20:21:26,694 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} #valid := #valid[0 := 0]; {602#true} is VALID [2020-07-10 20:21:26,694 INFO L280 TraceCheckUtils]: 3: Hoare triple {602#true} assume 0 < #StackHeapBarrier; {602#true} is VALID [2020-07-10 20:21:26,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#true} ~N~0 := 0; {602#true} is VALID [2020-07-10 20:21:26,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 20:21:26,696 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {602#true} {602#true} #132#return; {602#true} is VALID [2020-07-10 20:21:26,696 INFO L263 TraceCheckUtils]: 7: Hoare triple {602#true} call #t~ret12 := main(); {602#true} is VALID [2020-07-10 20:21:26,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {602#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {602#true} is VALID [2020-07-10 20:21:26,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#true} ~N~0 := #t~nondet0; {602#true} is VALID [2020-07-10 20:21:26,697 INFO L280 TraceCheckUtils]: 10: Hoare triple {602#true} havoc #t~nondet0; {602#true} is VALID [2020-07-10 20:21:26,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {602#true} assume !(~N~0 <= 0); {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,699 INFO L263 TraceCheckUtils]: 12: Hoare triple {610#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {602#true} is VALID [2020-07-10 20:21:26,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {602#true} ~cond := #in~cond; {602#true} is VALID [2020-07-10 20:21:26,700 INFO L280 TraceCheckUtils]: 14: Hoare triple {602#true} assume !(0 == ~cond); {602#true} is VALID [2020-07-10 20:21:26,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-10 20:21:26,701 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {602#true} {610#(<= 1 ~N~0)} #128#return; {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {610#(<= 1 ~N~0)} havoc ~i~0; {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {610#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,708 INFO L280 TraceCheckUtils]: 22: Hoare triple {610#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,709 INFO L280 TraceCheckUtils]: 23: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {610#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:26,710 INFO L280 TraceCheckUtils]: 24: Hoare triple {610#(<= 1 ~N~0)} ~i~0 := 0; {615#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:26,712 INFO L280 TraceCheckUtils]: 25: Hoare triple {615#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-10 20:21:26,712 INFO L280 TraceCheckUtils]: 26: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-10 20:21:26,713 INFO L280 TraceCheckUtils]: 27: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-10 20:21:26,713 INFO L280 TraceCheckUtils]: 28: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-10 20:21:26,713 INFO L280 TraceCheckUtils]: 29: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-10 20:21:26,714 INFO L280 TraceCheckUtils]: 30: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-10 20:21:26,714 INFO L280 TraceCheckUtils]: 31: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-10 20:21:26,715 INFO L280 TraceCheckUtils]: 32: Hoare triple {603#false} SUMMARY for call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {603#false} is VALID [2020-07-10 20:21:26,715 INFO L263 TraceCheckUtils]: 33: Hoare triple {603#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {603#false} is VALID [2020-07-10 20:21:26,715 INFO L280 TraceCheckUtils]: 34: Hoare triple {603#false} ~cond := #in~cond; {603#false} is VALID [2020-07-10 20:21:26,716 INFO L280 TraceCheckUtils]: 35: Hoare triple {603#false} assume 0 == ~cond; {603#false} is VALID [2020-07-10 20:21:26,716 INFO L280 TraceCheckUtils]: 36: Hoare triple {603#false} assume !false; {603#false} is VALID [2020-07-10 20:21:26,719 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:26,720 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:26,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [258977890] [2020-07-10 20:21:26,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:26,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:26,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769731201] [2020-07-10 20:21:26,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:26,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:26,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:26,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:26,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:26,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:26,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:26,774 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2020-07-10 20:21:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,512 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-07-10 20:21:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:27,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-10 20:21:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-10 20:21:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-10 20:21:27,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-10 20:21:27,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:27,672 INFO L225 Difference]: With dead ends: 118 [2020-07-10 20:21:27,673 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 20:21:27,674 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:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 20:21:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-07-10 20:21:27,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:27,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2020-07-10 20:21:27,783 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2020-07-10 20:21:27,783 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2020-07-10 20:21:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,790 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-10 20:21:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-10 20:21:27,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:27,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:27,792 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2020-07-10 20:21:27,793 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2020-07-10 20:21:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:27,798 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-10 20:21:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-10 20:21:27,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:27,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:27,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:27,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 20:21:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-07-10 20:21:27,803 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 37 [2020-07-10 20:21:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:27,804 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-07-10 20:21:27,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:27,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2020-07-10 20:21:27,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-10 20:21:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-10 20:21:27,903 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:27,904 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, 1, 1, 1, 1, 1] [2020-07-10 20:21:27,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:27,904 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1623654441, now seen corresponding path program 1 times [2020-07-10 20:21:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:27,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096919288] [2020-07-10 20:21:27,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:27,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:27,931 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:27,938 INFO L168 Benchmark]: Toolchain (without parser) took 4098.27 ms. Allocated memory was 137.4 MB in the beginning and 250.1 MB in the end (delta: 112.7 MB). Free memory was 102.0 MB in the beginning and 96.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 118.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:27,938 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:27,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.10 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 90.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:27,940 INFO L168 Benchmark]: Boogie Preprocessor took 157.00 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:27,941 INFO L168 Benchmark]: RCFGBuilder took 643.19 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 146.9 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:27,942 INFO L168 Benchmark]: TraceAbstraction took 2961.61 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 145.9 MB in the beginning and 96.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:27,946 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.27 ms. Allocated memory is still 137.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.10 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 90.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 157.00 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 643.19 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 146.9 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2961.61 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 145.9 MB in the beginning and 96.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 97.0 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...