/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/sina2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:37,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:37,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:37,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:37,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:37,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:37,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:37,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:37,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:37,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:37,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:37,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:37,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:37,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:37,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:37,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:37,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:37,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:37,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:37,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:37,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:37,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:37,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:37,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:37,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:37,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:37,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:37,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:37,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:37,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:37,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:37,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:37,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:37,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:37,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:37,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:37,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:37,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:37,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:37,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:37,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:37,507 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:37,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:37,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:37,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:37,524 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:37,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:37,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:37,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:37,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:37,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:37,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:37,527 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:37,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:37,527 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:37,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:37,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:37,528 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:37,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:37,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:37,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:37,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:37,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:37,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:37,530 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:37,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:37,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:37,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:37,834 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:37,835 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:37,836 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-10 20:21:37,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88fb3acc/012a49951f574b7eac2ec36bccc86a5d/FLAG35a18cae9 [2020-07-10 20:21:38,375 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:38,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-10 20:21:38,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88fb3acc/012a49951f574b7eac2ec36bccc86a5d/FLAG35a18cae9 [2020-07-10 20:21:38,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88fb3acc/012a49951f574b7eac2ec36bccc86a5d [2020-07-10 20:21:38,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:38,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:38,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:38,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:38,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:38,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:38" (1/1) ... [2020-07-10 20:21:38,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd0d620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:38, skipping insertion in model container [2020-07-10 20:21:38,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:38" (1/1) ... [2020-07-10 20:21:38,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:38,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:39,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:39,042 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:39,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:39,172 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:39,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39 WrapperNode [2020-07-10 20:21:39,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:39,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:39,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:39,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:39,184 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:39" (1/1) ... [2020-07-10 20:21:39,184 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:39" (1/1) ... [2020-07-10 20:21:39,192 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:39" (1/1) ... [2020-07-10 20:21:39,192 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:39" (1/1) ... [2020-07-10 20:21:39,217 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:39" (1/1) ... [2020-07-10 20:21:39,225 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:39" (1/1) ... [2020-07-10 20:21:39,228 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:39" (1/1) ... [2020-07-10 20:21:39,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:39,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:39,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:39,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:39,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (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:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:39,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:39,751 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:39,752 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 20:21:39,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:39 BoogieIcfgContainer [2020-07-10 20:21:39,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:39,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:39,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:39,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:39,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:38" (1/3) ... [2020-07-10 20:21:39,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cea7957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:39, skipping insertion in model container [2020-07-10 20:21:39,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:39" (2/3) ... [2020-07-10 20:21:39,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cea7957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:39, skipping insertion in model container [2020-07-10 20:21:39,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:39" (3/3) ... [2020-07-10 20:21:39,765 INFO L109 eAbstractionObserver]: Analyzing ICFG sina2f.c [2020-07-10 20:21:39,775 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:39,782 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:39,799 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:39,820 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:39,820 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:39,820 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:39,821 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:39,821 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:39,821 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:39,821 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:39,821 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-10 20:21:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:21:39,847 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:39,848 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] [2020-07-10 20:21:39,848 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1325521379, now seen corresponding path program 1 times [2020-07-10 20:21:39,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:39,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814468577] [2020-07-10 20:21:39,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(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; {74#true} is VALID [2020-07-10 20:21:40,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-10 20:21:40,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-10 20:21:40,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-10 20:21:40,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:21:40,122 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #129#return; {74#true} is VALID [2020-07-10 20:21:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-10 20:21:40,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-10 20:21:40,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:21:40,137 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #125#return; {74#true} is VALID [2020-07-10 20:21:40,139 INFO L263 TraceCheckUtils]: 0: Hoare triple {74#true} call ULTIMATE.init(); {86#(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:40,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(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; {74#true} is VALID [2020-07-10 20:21:40,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-10 20:21:40,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-10 20:21:40,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-10 20:21:40,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:21:40,142 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #129#return; {74#true} is VALID [2020-07-10 20:21:40,142 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-10 20:21:40,143 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-10 20:21:40,143 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-10 20:21:40,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-10 20:21:40,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-10 20:21:40,144 INFO L263 TraceCheckUtils]: 12: Hoare triple {74#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {74#true} is VALID [2020-07-10 20:21:40,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-10 20:21:40,145 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-10 20:21:40,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-10 20:21:40,146 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #125#return; {74#true} is VALID [2020-07-10 20:21:40,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-10 20:21:40,147 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {74#true} is VALID [2020-07-10 20:21:40,147 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {74#true} is VALID [2020-07-10 20:21:40,148 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-10 20:21:40,148 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {74#true} is VALID [2020-07-10 20:21:40,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-10 20:21:40,150 INFO L280 TraceCheckUtils]: 23: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-10 20:21:40,151 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-10 20:21:40,151 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-10 20:21:40,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-10 20:21:40,152 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-10 20:21:40,153 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-10 20:21:40,153 INFO L280 TraceCheckUtils]: 29: Hoare triple {75#false} assume !!(~i~0 < ~N~0); {75#false} is VALID [2020-07-10 20:21:40,153 INFO L280 TraceCheckUtils]: 30: Hoare triple {75#false} SUMMARY for call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L47 {75#false} is VALID [2020-07-10 20:21:40,154 INFO L263 TraceCheckUtils]: 31: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {75#false} is VALID [2020-07-10 20:21:40,154 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-10 20:21:40,155 INFO L280 TraceCheckUtils]: 33: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-10 20:21:40,155 INFO L280 TraceCheckUtils]: 34: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-10 20:21:40,161 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:40,161 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:40,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1814468577] [2020-07-10 20:21:40,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:40,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:40,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586531517] [2020-07-10 20:21:40,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-10 20:21:40,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:40,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:40,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:40,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:40,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:40,264 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-10 20:21:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:40,689 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2020-07-10 20:21:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:40,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-10 20:21:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-10 20:21:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-10 20:21:40,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2020-07-10 20:21:40,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:40,916 INFO L225 Difference]: With dead ends: 125 [2020-07-10 20:21:40,916 INFO L226 Difference]: Without dead ends: 62 [2020-07-10 20:21:40,921 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:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-10 20:21:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-10 20:21:41,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:41,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:41,019 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:41,019 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,026 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-10 20:21:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:41,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,028 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:41,028 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-10 20:21:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,035 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-10 20:21:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:41,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:41,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 20:21:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-10 20:21:41,043 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 35 [2020-07-10 20:21:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:41,043 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-10 20:21:41,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:41,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-10 20:21:41,131 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:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-10 20:21:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:21:41,133 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:41,133 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] [2020-07-10 20:21:41,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:41,134 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:41,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1536754598, now seen corresponding path program 1 times [2020-07-10 20:21:41,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:41,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806165773] [2020-07-10 20:21:41,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {601#(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; {587#true} is VALID [2020-07-10 20:21:41,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} #valid := #valid[0 := 0]; {587#true} is VALID [2020-07-10 20:21:41,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-10 20:21:41,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {587#true} ~N~0 := 0; {587#true} is VALID [2020-07-10 20:21:41,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 20:21:41,255 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {587#true} {587#true} #129#return; {587#true} is VALID [2020-07-10 20:21:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:41,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2020-07-10 20:21:41,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2020-07-10 20:21:41,270 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 20:21:41,271 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {587#true} {595#(<= 1 ~N~0)} #125#return; {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,272 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {601#(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:41,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {601#(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; {587#true} is VALID [2020-07-10 20:21:41,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} #valid := #valid[0 := 0]; {587#true} is VALID [2020-07-10 20:21:41,273 INFO L280 TraceCheckUtils]: 3: Hoare triple {587#true} assume 0 < #StackHeapBarrier; {587#true} is VALID [2020-07-10 20:21:41,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} ~N~0 := 0; {587#true} is VALID [2020-07-10 20:21:41,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 20:21:41,274 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {587#true} {587#true} #129#return; {587#true} is VALID [2020-07-10 20:21:41,274 INFO L263 TraceCheckUtils]: 7: Hoare triple {587#true} call #t~ret11 := main(); {587#true} is VALID [2020-07-10 20:21:41,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {587#true} is VALID [2020-07-10 20:21:41,275 INFO L280 TraceCheckUtils]: 9: Hoare triple {587#true} ~N~0 := #t~nondet0; {587#true} is VALID [2020-07-10 20:21:41,275 INFO L280 TraceCheckUtils]: 10: Hoare triple {587#true} havoc #t~nondet0; {587#true} is VALID [2020-07-10 20:21:41,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {587#true} assume !(~N~0 <= 0); {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,283 INFO L263 TraceCheckUtils]: 12: Hoare triple {595#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {587#true} is VALID [2020-07-10 20:21:41,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2020-07-10 20:21:41,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2020-07-10 20:21:41,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-10 20:21:41,285 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {587#true} {595#(<= 1 ~N~0)} #125#return; {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(<= 1 ~N~0)} havoc ~i~0; {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,290 INFO L280 TraceCheckUtils]: 20: Hoare triple {595#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,290 INFO L280 TraceCheckUtils]: 21: Hoare triple {595#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {595#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {595#(<= 1 ~N~0)} ~i~0 := 0; {600#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:41,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {600#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-10 20:21:41,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-10 20:21:41,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {588#false} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-10 20:21:41,293 INFO L280 TraceCheckUtils]: 26: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-10 20:21:41,294 INFO L280 TraceCheckUtils]: 27: Hoare triple {588#false} assume !(~i~0 < ~N~0); {588#false} is VALID [2020-07-10 20:21:41,294 INFO L280 TraceCheckUtils]: 28: Hoare triple {588#false} ~i~0 := 0; {588#false} is VALID [2020-07-10 20:21:41,294 INFO L280 TraceCheckUtils]: 29: Hoare triple {588#false} assume !!(~i~0 < ~N~0); {588#false} is VALID [2020-07-10 20:21:41,295 INFO L280 TraceCheckUtils]: 30: Hoare triple {588#false} SUMMARY for call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L47 {588#false} is VALID [2020-07-10 20:21:41,295 INFO L263 TraceCheckUtils]: 31: Hoare triple {588#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {588#false} is VALID [2020-07-10 20:21:41,295 INFO L280 TraceCheckUtils]: 32: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-10 20:21:41,296 INFO L280 TraceCheckUtils]: 33: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-10 20:21:41,297 INFO L280 TraceCheckUtils]: 34: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-10 20:21:41,300 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:41,301 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:41,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806165773] [2020-07-10 20:21:41,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:41,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428410225] [2020-07-10 20:21:41,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 20:21:41,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:41,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:41,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:41,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:41,355 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2020-07-10 20:21:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,960 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2020-07-10 20:21:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:41,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-10 20:21:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2020-07-10 20:21:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2020-07-10 20:21:41,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 131 transitions. [2020-07-10 20:21:42,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:42,121 INFO L225 Difference]: With dead ends: 122 [2020-07-10 20:21:42,122 INFO L226 Difference]: Without dead ends: 88 [2020-07-10 20:21:42,123 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:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-10 20:21:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-07-10 20:21:42,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:42,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 65 states. [2020-07-10 20:21:42,248 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 65 states. [2020-07-10 20:21:42,249 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 65 states. [2020-07-10 20:21:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,255 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2020-07-10 20:21:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2020-07-10 20:21:42,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:42,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:42,257 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 88 states. [2020-07-10 20:21:42,257 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 88 states. [2020-07-10 20:21:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:42,262 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2020-07-10 20:21:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2020-07-10 20:21:42,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:42,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:42,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:42,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-10 20:21:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-10 20:21:42,267 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 35 [2020-07-10 20:21:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:42,268 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-10 20:21:42,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:42,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2020-07-10 20:21:42,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 20:21:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 20:21:42,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:42,363 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] [2020-07-10 20:21:42,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:42,364 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash -313984591, now seen corresponding path program 1 times [2020-07-10 20:21:42,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:42,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644682069] [2020-07-10 20:21:42,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:42,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:42,400 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:42,406 INFO L168 Benchmark]: Toolchain (without parser) took 3607.41 ms. Allocated memory was 137.9 MB in the beginning and 247.5 MB in the end (delta: 109.6 MB). Free memory was 101.3 MB in the beginning and 215.3 MB in the end (delta: -114.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:42,407 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 137.9 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.47 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 182.0 MB in the end (delta: -80.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,409 INFO L168 Benchmark]: Boogie Preprocessor took 59.44 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 179.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,410 INFO L168 Benchmark]: RCFGBuilder took 520.44 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 148.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,411 INFO L168 Benchmark]: TraceAbstraction took 2645.10 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 148.3 MB in the beginning and 215.3 MB in the end (delta: -67.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:21:42,415 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.9 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.47 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 182.0 MB in the end (delta: -80.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.44 ms. Allocated memory is still 202.9 MB. Free memory was 182.0 MB in the beginning and 179.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.44 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 148.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2645.10 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 148.3 MB in the beginning and 215.3 MB in the end (delta: -67.0 MB). There was no memory consumed. 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...