/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/sina1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:37,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:37,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:37,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:37,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:37,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:37,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:37,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:37,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:37,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:37,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:37,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:37,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:37,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:37,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:37,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:37,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:37,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:37,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:37,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:37,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:37,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:37,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:37,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:37,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:37,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:37,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:37,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:37,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:37,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:37,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:37,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:37,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:37,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:37,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:37,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:37,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:37,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:37,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:37,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:37,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:37,331 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,341 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:37,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:37,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:37,343 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:37,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:37,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:37,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:37,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:37,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:37,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:37,345 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:37,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:37,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:37,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:37,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:37,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:37,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:37,346 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:37,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:37,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:37,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:37,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:37,650 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:37,651 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-10 20:21:37,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1ed0021/3cf886d4944a4ce2aa22589e845dc31d/FLAG22afae643 [2020-07-10 20:21:38,228 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:38,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-10 20:21:38,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1ed0021/3cf886d4944a4ce2aa22589e845dc31d/FLAG22afae643 [2020-07-10 20:21:38,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd1ed0021/3cf886d4944a4ce2aa22589e845dc31d [2020-07-10 20:21:38,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:38,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:38,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:38,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:38,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:38,568 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,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9ee34c 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,572 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,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:38,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:38,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:38,806 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:38,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:38,851 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:38,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:38 WrapperNode [2020-07-10 20:21:38,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:38,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:38,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:38,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:38,959 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:38" (1/1) ... [2020-07-10 20:21:38,959 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:38" (1/1) ... [2020-07-10 20:21:38,971 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:38" (1/1) ... [2020-07-10 20:21:38,972 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:38" (1/1) ... [2020-07-10 20:21:38,983 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:38" (1/1) ... [2020-07-10 20:21:38,990 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:38" (1/1) ... [2020-07-10 20:21:38,991 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:38" (1/1) ... [2020-07-10 20:21:38,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:38,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:38,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:38,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:38,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:38" (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,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:39,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:39,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:39,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:39,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:39,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:39,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:39,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:39,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:39,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:39,507 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:39,508 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:21:39,513 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,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:39,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:39,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:39,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:39,518 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,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698f269c 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,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:38" (2/3) ... [2020-07-10 20:21:39,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698f269c 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,520 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,522 INFO L109 eAbstractionObserver]: Analyzing ICFG sina1f.c [2020-07-10 20:21:39,533 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:39,539 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:39,551 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:39,573 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:39,574 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:39,574 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:39,574 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:39,574 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:39,574 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:39,575 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:39,575 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-10 20:21:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:39,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:39,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:39,607 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 864246722, now seen corresponding path program 1 times [2020-07-10 20:21:39,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:39,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408905428] [2020-07-10 20:21:39,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:39,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {76#(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; {64#true} is VALID [2020-07-10 20:21:39,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-10 20:21:39,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 20:21:39,888 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-10 20:21:39,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:39,889 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-10 20:21:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:39,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-10 20:21:39,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-10 20:21:39,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:39,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-10 20:21:39,911 INFO L263 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {76#(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:39,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#(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; {64#true} is VALID [2020-07-10 20:21:39,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-10 20:21:39,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 20:21:39,913 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-10 20:21:39,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:39,916 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-10 20:21:39,916 INFO L263 TraceCheckUtils]: 7: Hoare triple {64#true} call #t~ret8 := main(); {64#true} is VALID [2020-07-10 20:21:39,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {64#true} is VALID [2020-07-10 20:21:39,917 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#true} ~N~0 := #t~nondet0; {64#true} is VALID [2020-07-10 20:21:39,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {64#true} havoc #t~nondet0; {64#true} is VALID [2020-07-10 20:21:39,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {64#true} assume !(~N~0 <= 0); {64#true} is VALID [2020-07-10 20:21:39,921 INFO L263 TraceCheckUtils]: 12: Hoare triple {64#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {64#true} is VALID [2020-07-10 20:21:39,922 INFO L280 TraceCheckUtils]: 13: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-10 20:21:39,923 INFO L280 TraceCheckUtils]: 14: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-10 20:21:39,923 INFO L280 TraceCheckUtils]: 15: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:39,924 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-10 20:21:39,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#true} havoc ~i~0; {64#true} is VALID [2020-07-10 20:21:39,926 INFO L280 TraceCheckUtils]: 18: Hoare triple {64#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {64#true} is VALID [2020-07-10 20:21:39,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {64#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {64#true} is VALID [2020-07-10 20:21:39,927 INFO L280 TraceCheckUtils]: 20: Hoare triple {64#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {64#true} is VALID [2020-07-10 20:21:39,928 INFO L280 TraceCheckUtils]: 21: Hoare triple {64#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {64#true} is VALID [2020-07-10 20:21:39,928 INFO L280 TraceCheckUtils]: 22: Hoare triple {64#true} ~i~0 := 0; {64#true} is VALID [2020-07-10 20:21:39,930 INFO L280 TraceCheckUtils]: 23: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-10 20:21:39,930 INFO L280 TraceCheckUtils]: 24: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-10 20:21:39,931 INFO L280 TraceCheckUtils]: 25: Hoare triple {65#false} assume !(~i~0 < ~N~0); {65#false} is VALID [2020-07-10 20:21:39,931 INFO L280 TraceCheckUtils]: 26: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-10 20:21:39,932 INFO L280 TraceCheckUtils]: 27: Hoare triple {65#false} assume !!(~i~0 < ~N~0); {65#false} is VALID [2020-07-10 20:21:39,932 INFO L280 TraceCheckUtils]: 28: Hoare triple {65#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {65#false} is VALID [2020-07-10 20:21:39,932 INFO L263 TraceCheckUtils]: 29: Hoare triple {65#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {65#false} is VALID [2020-07-10 20:21:39,933 INFO L280 TraceCheckUtils]: 30: Hoare triple {65#false} ~cond := #in~cond; {65#false} is VALID [2020-07-10 20:21:39,933 INFO L280 TraceCheckUtils]: 31: Hoare triple {65#false} assume 0 == ~cond; {65#false} is VALID [2020-07-10 20:21:39,934 INFO L280 TraceCheckUtils]: 32: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-10 20:21:39,944 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:39,945 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:39,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408905428] [2020-07-10 20:21:39,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:39,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:39,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097619377] [2020-07-10 20:21:39,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:39,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:39,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:40,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:40,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:40,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:40,053 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-10 20:21:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:40,436 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-07-10 20:21:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:40,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-10 20:21:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-10 20:21:40,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-10 20:21:40,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:40,616 INFO L225 Difference]: With dead ends: 105 [2020-07-10 20:21:40,616 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 20:21:40,620 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,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 20:21:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 20:21:40,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:40,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:40,706 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:40,706 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:40,712 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:21:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:40,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:40,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:40,714 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:40,714 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:40,719 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:21:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:40,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:40,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:40,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:40,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:21:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-10 20:21:40,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 33 [2020-07-10 20:21:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:40,727 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-10 20:21:40,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:40,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-10 20:21:40,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:40,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:40,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:40,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:40,797 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1269072019, now seen corresponding path program 1 times [2020-07-10 20:21:40,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:40,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678462951] [2020-07-10 20:21:40,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {511#(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; {497#true} is VALID [2020-07-10 20:21:40,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-10 20:21:40,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-10 20:21:40,961 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-10 20:21:40,961 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:40,962 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-10 20:21:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:40,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-10 20:21:40,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-10 20:21:40,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:40,986 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {511#(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,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {511#(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; {497#true} is VALID [2020-07-10 20:21:40,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-10 20:21:40,989 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-10 20:21:40,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-10 20:21:40,989 INFO L280 TraceCheckUtils]: 5: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:40,990 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-10 20:21:40,990 INFO L263 TraceCheckUtils]: 7: Hoare triple {497#true} call #t~ret8 := main(); {497#true} is VALID [2020-07-10 20:21:40,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {497#true} is VALID [2020-07-10 20:21:40,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#true} ~N~0 := #t~nondet0; {497#true} is VALID [2020-07-10 20:21:40,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {497#true} havoc #t~nondet0; {497#true} is VALID [2020-07-10 20:21:40,994 INFO L280 TraceCheckUtils]: 11: Hoare triple {497#true} assume !(~N~0 <= 0); {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,994 INFO L263 TraceCheckUtils]: 12: Hoare triple {505#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {497#true} is VALID [2020-07-10 20:21:40,995 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-10 20:21:40,995 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-10 20:21:40,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:40,996 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {497#true} {505#(<= 1 ~N~0)} #104#return; {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#(<= 1 ~N~0)} havoc ~i~0; {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,999 INFO L280 TraceCheckUtils]: 19: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:40,999 INFO L280 TraceCheckUtils]: 20: Hoare triple {505#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,000 INFO L280 TraceCheckUtils]: 21: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:41,001 INFO L280 TraceCheckUtils]: 22: Hoare triple {505#(<= 1 ~N~0)} ~i~0 := 0; {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 20:21:41,003 INFO L280 TraceCheckUtils]: 23: Hoare triple {510#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-10 20:21:41,003 INFO L280 TraceCheckUtils]: 24: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-10 20:21:41,003 INFO L280 TraceCheckUtils]: 25: Hoare triple {498#false} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-10 20:21:41,003 INFO L280 TraceCheckUtils]: 26: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-10 20:21:41,004 INFO L280 TraceCheckUtils]: 27: Hoare triple {498#false} assume !!(~i~0 < ~N~0); {498#false} is VALID [2020-07-10 20:21:41,004 INFO L280 TraceCheckUtils]: 28: Hoare triple {498#false} SUMMARY for call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L42 {498#false} is VALID [2020-07-10 20:21:41,004 INFO L263 TraceCheckUtils]: 29: Hoare triple {498#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {498#false} is VALID [2020-07-10 20:21:41,005 INFO L280 TraceCheckUtils]: 30: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2020-07-10 20:21:41,005 INFO L280 TraceCheckUtils]: 31: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2020-07-10 20:21:41,005 INFO L280 TraceCheckUtils]: 32: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-10 20:21:41,009 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,009 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:41,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678462951] [2020-07-10 20:21:41,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:41,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:41,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516433386] [2020-07-10 20:21:41,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:41,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:41,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:41,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:41,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:41,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:41,073 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2020-07-10 20:21:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,608 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-07-10 20:21:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:41,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-10 20:21:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-10 20:21:41,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2020-07-10 20:21:41,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,739 INFO L225 Difference]: With dead ends: 92 [2020-07-10 20:21:41,740 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:21:41,741 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:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:21:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-10 20:21:41,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:41,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:41,856 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:41,856 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,869 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 20:21:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-10 20:21:41,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,872 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-10 20:21:41,872 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-10 20:21:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:41,881 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 20:21:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-10 20:21:41,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:41,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:41,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:41,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:21:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-07-10 20:21:41,891 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 33 [2020-07-10 20:21:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:41,892 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-07-10 20:21:41,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:41,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2020-07-10 20:21:41,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 20:21:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 20:21:41,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:41,980 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] [2020-07-10 20:21:41,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:41,981 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1661969402, now seen corresponding path program 1 times [2020-07-10 20:21:41,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:41,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249210447] [2020-07-10 20:21:41,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:42,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:42,029 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,035 INFO L168 Benchmark]: Toolchain (without parser) took 3473.09 ms. Allocated memory was 137.9 MB in the beginning and 247.5 MB in the end (delta: 109.6 MB). Free memory was 103.8 MB in the beginning and 136.7 MB in the end (delta: -32.9 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,036 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.43 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 92.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,038 INFO L168 Benchmark]: Boogie Preprocessor took 141.60 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 92.7 MB in the beginning and 180.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,039 INFO L168 Benchmark]: RCFGBuilder took 518.59 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 152.9 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,040 INFO L168 Benchmark]: TraceAbstraction took 2517.63 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 152.2 MB in the beginning and 136.7 MB in the end (delta: 15.5 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:42,044 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.43 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 92.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.60 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 92.7 MB in the beginning and 180.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 518.59 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 152.9 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2517.63 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 152.2 MB in the beginning and 136.7 MB in the end (delta: 15.5 MB). Peak memory consumption was 60.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...