/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/indp3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:21,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:21,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:21,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:21,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:21,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:21,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:21,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:21,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:21,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:21,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:21,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:21,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:21,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:21,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:21,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:21,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:21,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:21,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:21,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:21,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:21,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:21,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:21,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:21,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:21,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:21,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:21,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:21,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:21,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:21,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:21,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:21,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:21,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:21,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:21,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:21,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:21,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:21,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:21,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:21,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:21,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:21,245 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:21,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:21,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:21,247 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:21,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:21,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:21,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:21,251 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:21,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:21,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:21,252 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:21,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:21,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:21,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:21,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:21,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:21,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:21,255 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:21,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:21,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:21,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:21,545 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:21,545 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:21,546 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp3f.c [2020-07-18 00:47:21,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e49fa89/2cffc2226fb64d29828c06c849b9c8ac/FLAGc5d139288 [2020-07-18 00:47:22,057 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:22,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp3f.c [2020-07-18 00:47:22,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e49fa89/2cffc2226fb64d29828c06c849b9c8ac/FLAGc5d139288 [2020-07-18 00:47:22,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e49fa89/2cffc2226fb64d29828c06c849b9c8ac [2020-07-18 00:47:22,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:22,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:22,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:22,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:22,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:22,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867a2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22, skipping insertion in model container [2020-07-18 00:47:22,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:22,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:22,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:22,641 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:22,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:22,680 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:22,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22 WrapperNode [2020-07-18 00:47:22,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:22,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:22,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:22,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:22,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (1/1) ... [2020-07-18 00:47:22,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:22,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:22,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:22,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:22,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (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-18 00:47:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:23,350 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:23,351 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-18 00:47:23,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:23 BoogieIcfgContainer [2020-07-18 00:47:23,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:23,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:23,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:23,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:23,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:22" (1/3) ... [2020-07-18 00:47:23,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afd430e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:23, skipping insertion in model container [2020-07-18 00:47:23,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:22" (2/3) ... [2020-07-18 00:47:23,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afd430e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:23, skipping insertion in model container [2020-07-18 00:47:23,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:23" (3/3) ... [2020-07-18 00:47:23,364 INFO L109 eAbstractionObserver]: Analyzing ICFG indp3f.c [2020-07-18 00:47:23,373 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:23,380 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:23,393 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:23,414 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:23,414 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:23,415 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:23,415 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:23,415 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:23,415 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:23,415 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:23,416 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-18 00:47:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:23,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:23,444 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-18 00:47:23,444 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash 13261349, now seen corresponding path program 1 times [2020-07-18 00:47:23,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:23,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055435976] [2020-07-18 00:47:23,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:23,703 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-18 00:47:23,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:23,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:23,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:23,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:23,707 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #140#return; {74#true} is VALID [2020-07-18 00:47:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:23,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:23,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:23,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:23,738 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #136#return; {74#true} is VALID [2020-07-18 00:47:23,741 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-18 00:47:23,742 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-18 00:47:23,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-18 00:47:23,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-18 00:47:23,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-18 00:47:23,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:23,744 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #140#return; {74#true} is VALID [2020-07-18 00:47:23,746 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-18 00:47:23,746 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-18 00:47:23,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-18 00:47:23,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-18 00:47:23,748 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-18 00:47:23,751 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-18 00:47:23,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-18 00:47:23,752 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-18 00:47:23,752 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-18 00:47:23,753 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #136#return; {74#true} is VALID [2020-07-18 00:47:23,753 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-18 00:47:23,755 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26 {74#true} is VALID [2020-07-18 00:47:23,755 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-18 00:47:23,755 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-18 00:47:23,759 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-18 00:47:23,759 INFO L280 TraceCheckUtils]: 22: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:23,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:23,760 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:23,760 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-18 00:47:23,761 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:23,761 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !(~i~0 < ~N~0); {75#false} is VALID [2020-07-18 00:47:23,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-18 00:47:23,762 INFO L280 TraceCheckUtils]: 29: Hoare triple {75#false} assume !!(~i~0 < ~N~0); {75#false} is VALID [2020-07-18 00:47:23,763 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: L50 {75#false} is VALID [2020-07-18 00:47:23,763 INFO L263 TraceCheckUtils]: 31: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == 1 + ~i~0 * ~i~0 then 1 else 0)); {75#false} is VALID [2020-07-18 00:47:23,764 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-18 00:47:23,764 INFO L280 TraceCheckUtils]: 33: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-18 00:47:23,764 INFO L280 TraceCheckUtils]: 34: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-18 00:47:23,773 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-18 00:47:23,776 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:23,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055435976] [2020-07-18 00:47:23,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:23,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:23,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785355312] [2020-07-18 00:47:23,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:23,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:23,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:23,850 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-18 00:47:23,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:23,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:23,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:23,862 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-18 00:47:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:24,258 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2020-07-18 00:47:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:24,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2020-07-18 00:47:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2020-07-18 00:47:24,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2020-07-18 00:47:24,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:24,469 INFO L225 Difference]: With dead ends: 125 [2020-07-18 00:47:24,470 INFO L226 Difference]: Without dead ends: 64 [2020-07-18 00:47:24,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-18 00:47:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-18 00:47:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-18 00:47:24,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:24,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2020-07-18 00:47:24,568 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-18 00:47:24,569 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-18 00:47:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:24,576 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-07-18 00:47:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-18 00:47:24,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:24,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:24,578 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-18 00:47:24,578 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-18 00:47:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:24,584 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2020-07-18 00:47:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-18 00:47:24,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:24,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:24,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:24,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-18 00:47:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-07-18 00:47:24,593 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 35 [2020-07-18 00:47:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:24,593 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-07-18 00:47:24,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:24,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2020-07-18 00:47:24,677 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-18 00:47:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-18 00:47:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:24,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:24,679 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-18 00:47:24,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:24,680 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1010060324, now seen corresponding path program 1 times [2020-07-18 00:47:24,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:24,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889832781] [2020-07-18 00:47:24,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:24,796 INFO L280 TraceCheckUtils]: 0: Hoare triple {609#(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; {595#true} is VALID [2020-07-18 00:47:24,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#true} #valid := #valid[0 := 0]; {595#true} is VALID [2020-07-18 00:47:24,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {595#true} assume 0 < #StackHeapBarrier; {595#true} is VALID [2020-07-18 00:47:24,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {595#true} ~N~0 := 0; {595#true} is VALID [2020-07-18 00:47:24,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {595#true} assume true; {595#true} is VALID [2020-07-18 00:47:24,798 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {595#true} {595#true} #140#return; {595#true} is VALID [2020-07-18 00:47:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:24,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#true} ~cond := #in~cond; {595#true} is VALID [2020-07-18 00:47:24,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#true} assume !(0 == ~cond); {595#true} is VALID [2020-07-18 00:47:24,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2020-07-18 00:47:24,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {595#true} {603#(<= 1 ~N~0)} #136#return; {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {609#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:24,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {609#(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; {595#true} is VALID [2020-07-18 00:47:24,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {595#true} #valid := #valid[0 := 0]; {595#true} is VALID [2020-07-18 00:47:24,810 INFO L280 TraceCheckUtils]: 3: Hoare triple {595#true} assume 0 < #StackHeapBarrier; {595#true} is VALID [2020-07-18 00:47:24,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {595#true} ~N~0 := 0; {595#true} is VALID [2020-07-18 00:47:24,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {595#true} assume true; {595#true} is VALID [2020-07-18 00:47:24,811 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {595#true} {595#true} #140#return; {595#true} is VALID [2020-07-18 00:47:24,811 INFO L263 TraceCheckUtils]: 7: Hoare triple {595#true} call #t~ret11 := main(); {595#true} is VALID [2020-07-18 00:47:24,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {595#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {595#true} is VALID [2020-07-18 00:47:24,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {595#true} ~N~0 := #t~nondet0; {595#true} is VALID [2020-07-18 00:47:24,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {595#true} havoc #t~nondet0; {595#true} is VALID [2020-07-18 00:47:24,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#true} assume !(~N~0 <= 0); {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,814 INFO L263 TraceCheckUtils]: 12: Hoare triple {603#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {595#true} is VALID [2020-07-18 00:47:24,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {595#true} ~cond := #in~cond; {595#true} is VALID [2020-07-18 00:47:24,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {595#true} assume !(0 == ~cond); {595#true} is VALID [2020-07-18 00:47:24,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {595#true} assume true; {595#true} is VALID [2020-07-18 00:47:24,816 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {595#true} {603#(<= 1 ~N~0)} #136#return; {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 ~N~0)} havoc ~i~0; {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26 {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,818 INFO L280 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {603#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:24,819 INFO L280 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 ~N~0)} ~i~0 := 0; {608#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:24,822 INFO L280 TraceCheckUtils]: 21: Hoare triple {608#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {596#false} is VALID [2020-07-18 00:47:24,823 INFO L280 TraceCheckUtils]: 22: Hoare triple {596#false} ~i~0 := 0; {596#false} is VALID [2020-07-18 00:47:24,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {596#false} assume !(~i~0 < ~N~0); {596#false} is VALID [2020-07-18 00:47:24,823 INFO L280 TraceCheckUtils]: 24: Hoare triple {596#false} ~i~0 := 0; {596#false} is VALID [2020-07-18 00:47:24,824 INFO L280 TraceCheckUtils]: 25: Hoare triple {596#false} assume !(~i~0 < ~N~0); {596#false} is VALID [2020-07-18 00:47:24,824 INFO L280 TraceCheckUtils]: 26: Hoare triple {596#false} ~i~0 := 0; {596#false} is VALID [2020-07-18 00:47:24,824 INFO L280 TraceCheckUtils]: 27: Hoare triple {596#false} assume !(~i~0 < ~N~0); {596#false} is VALID [2020-07-18 00:47:24,825 INFO L280 TraceCheckUtils]: 28: Hoare triple {596#false} ~i~0 := 0; {596#false} is VALID [2020-07-18 00:47:24,825 INFO L280 TraceCheckUtils]: 29: Hoare triple {596#false} assume !!(~i~0 < ~N~0); {596#false} is VALID [2020-07-18 00:47:24,825 INFO L280 TraceCheckUtils]: 30: Hoare triple {596#false} SUMMARY for call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L50 {596#false} is VALID [2020-07-18 00:47:24,826 INFO L263 TraceCheckUtils]: 31: Hoare triple {596#false} call __VERIFIER_assert((if #t~mem10 == 1 + ~i~0 * ~i~0 then 1 else 0)); {596#false} is VALID [2020-07-18 00:47:24,826 INFO L280 TraceCheckUtils]: 32: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2020-07-18 00:47:24,826 INFO L280 TraceCheckUtils]: 33: Hoare triple {596#false} assume 0 == ~cond; {596#false} is VALID [2020-07-18 00:47:24,827 INFO L280 TraceCheckUtils]: 34: Hoare triple {596#false} assume !false; {596#false} is VALID [2020-07-18 00:47:24,830 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-18 00:47:24,834 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:24,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889832781] [2020-07-18 00:47:24,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:24,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:24,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109309509] [2020-07-18 00:47:24,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:24,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:24,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:24,880 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-18 00:47:24,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:24,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:24,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:24,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:24,881 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2020-07-18 00:47:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:25,454 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2020-07-18 00:47:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:25,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2020-07-18 00:47:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2020-07-18 00:47:25,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 142 transitions. [2020-07-18 00:47:25,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:25,631 INFO L225 Difference]: With dead ends: 130 [2020-07-18 00:47:25,632 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 00:47:25,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 00:47:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2020-07-18 00:47:25,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:25,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 68 states. [2020-07-18 00:47:25,752 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 68 states. [2020-07-18 00:47:25,753 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 68 states. [2020-07-18 00:47:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:25,764 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-18 00:47:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-07-18 00:47:25,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:25,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:25,769 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 92 states. [2020-07-18 00:47:25,769 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 92 states. [2020-07-18 00:47:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:25,775 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-18 00:47:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-07-18 00:47:25,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:25,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:25,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:25,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-18 00:47:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-18 00:47:25,784 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 35 [2020-07-18 00:47:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:25,784 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-18 00:47:25,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:25,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2020-07-18 00:47:25,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-18 00:47:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 00:47:25,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:25,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:25,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:25,887 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1919266361, now seen corresponding path program 1 times [2020-07-18 00:47:25,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:25,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22942470] [2020-07-18 00:47:25,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:25,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:25,923 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:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) 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-18 00:47:25,929 INFO L168 Benchmark]: Toolchain (without parser) took 3496.94 ms. Allocated memory was 139.5 MB in the beginning and 246.4 MB in the end (delta: 107.0 MB). Free memory was 104.2 MB in the beginning and 194.4 MB in the end (delta: -90.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:25,929 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:25,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.80 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 92.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:25,931 INFO L168 Benchmark]: Boogie Preprocessor took 138.73 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 92.8 MB in the beginning and 182.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:25,932 INFO L168 Benchmark]: RCFGBuilder took 534.45 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 150.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:25,933 INFO L168 Benchmark]: TraceAbstraction took 2569.47 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 150.9 MB in the beginning and 194.4 MB in the end (delta: -43.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:25,936 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.20 ms. Allocated memory is still 139.5 MB. Free memory is still 122.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.80 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 92.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.73 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 92.8 MB in the beginning and 182.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 534.45 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 150.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2569.47 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 150.9 MB in the beginning and 194.4 MB in the end (delta: -43.5 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:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...