/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/modnf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:13,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:13,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:13,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:13,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:13,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:13,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:13,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:13,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:13,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:13,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:13,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:13,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:13,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:13,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:13,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:13,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:13,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:13,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:13,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:13,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:13,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:13,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:13,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:13,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:13,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:13,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:13,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:13,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:13,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:13,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:13,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:13,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:13,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:13,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:13,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:13,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:13,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:13,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:13,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:13,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:13,395 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:13,422 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:13,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:13,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:13,428 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:13,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:13,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:13,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:13,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:13,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:13,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:13,432 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:13,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:13,432 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:13,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:13,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:13,433 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:13,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:13,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:13,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:13,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:13,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:13,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:13,434 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:13,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:13,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:13,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:13,804 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:13,804 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:13,806 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modnf.c [2020-07-10 20:21:13,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801077578/dbf031dcff74425683a8ba8c8a087a1d/FLAG94d5f6153 [2020-07-10 20:21:14,479 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:14,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modnf.c [2020-07-10 20:21:14,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801077578/dbf031dcff74425683a8ba8c8a087a1d/FLAG94d5f6153 [2020-07-10 20:21:14,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801077578/dbf031dcff74425683a8ba8c8a087a1d [2020-07-10 20:21:14,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:14,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:14,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:14,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:14,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:14,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:14" (1/1) ... [2020-07-10 20:21:14,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:14, skipping insertion in model container [2020-07-10 20:21:14,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:14" (1/1) ... [2020-07-10 20:21:14,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:14,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:15,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:15,133 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:15,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:15,185 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:15,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15 WrapperNode [2020-07-10 20:21:15,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:15,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:15,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:15,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:15,296 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:15" (1/1) ... [2020-07-10 20:21:15,297 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:15" (1/1) ... [2020-07-10 20:21:15,306 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:15" (1/1) ... [2020-07-10 20:21:15,306 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:15" (1/1) ... [2020-07-10 20:21:15,335 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:15" (1/1) ... [2020-07-10 20:21:15,344 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:15" (1/1) ... [2020-07-10 20:21:15,346 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:15" (1/1) ... [2020-07-10 20:21:15,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:15,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:15,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:15,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:15,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (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:15,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:15,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:15,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:21:15,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:21:15,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:21:15,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:21:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:21:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 20:21:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 20:21:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:15,919 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:15,920 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:21:15,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:15 BoogieIcfgContainer [2020-07-10 20:21:15,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:15,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:15,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:15,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:15,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:14" (1/3) ... [2020-07-10 20:21:15,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40e9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:15, skipping insertion in model container [2020-07-10 20:21:15,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:15" (2/3) ... [2020-07-10 20:21:15,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40e9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:15, skipping insertion in model container [2020-07-10 20:21:15,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:15" (3/3) ... [2020-07-10 20:21:15,941 INFO L109 eAbstractionObserver]: Analyzing ICFG modnf.c [2020-07-10 20:21:15,954 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:15,963 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:15,978 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:16,004 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:16,004 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:16,004 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:16,004 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:16,005 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:16,005 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:16,005 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:16,005 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-07-10 20:21:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:16,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:16,038 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:16,039 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash 864246722, now seen corresponding path program 1 times [2020-07-10 20:21:16,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:16,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [680371405] [2020-07-10 20:21:16,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,372 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:16,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-10 20:21:16,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 20:21:16,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-10 20:21:16,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:16,375 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-10 20:21:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:16,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-10 20:21:16,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-10 20:21:16,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:16,388 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-10 20:21:16,390 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:16,391 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:16,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#true} #valid := #valid[0 := 0]; {64#true} is VALID [2020-07-10 20:21:16,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {64#true} assume 0 < #StackHeapBarrier; {64#true} is VALID [2020-07-10 20:21:16,392 INFO L280 TraceCheckUtils]: 4: Hoare triple {64#true} ~N~0 := 0; {64#true} is VALID [2020-07-10 20:21:16,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:16,393 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {64#true} {64#true} #108#return; {64#true} is VALID [2020-07-10 20:21:16,394 INFO L263 TraceCheckUtils]: 7: Hoare triple {64#true} call #t~ret8 := main(); {64#true} is VALID [2020-07-10 20:21:16,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {64#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {64#true} is VALID [2020-07-10 20:21:16,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#true} ~N~0 := #t~nondet0; {64#true} is VALID [2020-07-10 20:21:16,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {64#true} havoc #t~nondet0; {64#true} is VALID [2020-07-10 20:21:16,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {64#true} assume !(~N~0 <= 0); {64#true} is VALID [2020-07-10 20:21:16,396 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:16,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {64#true} ~cond := #in~cond; {64#true} is VALID [2020-07-10 20:21:16,398 INFO L280 TraceCheckUtils]: 14: Hoare triple {64#true} assume !(0 == ~cond); {64#true} is VALID [2020-07-10 20:21:16,398 INFO L280 TraceCheckUtils]: 15: Hoare triple {64#true} assume true; {64#true} is VALID [2020-07-10 20:21:16,399 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {64#true} {64#true} #104#return; {64#true} is VALID [2020-07-10 20:21:16,399 INFO L280 TraceCheckUtils]: 17: Hoare triple {64#true} havoc ~i~0; {64#true} is VALID [2020-07-10 20:21:16,400 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:16,400 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:16,401 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:16,402 INFO L280 TraceCheckUtils]: 21: Hoare triple {64#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {64#true} is VALID [2020-07-10 20:21:16,402 INFO L280 TraceCheckUtils]: 22: Hoare triple {64#true} ~i~0 := 0; {64#true} is VALID [2020-07-10 20:21:16,404 INFO L280 TraceCheckUtils]: 23: Hoare triple {64#true} assume !true; {65#false} is VALID [2020-07-10 20:21:16,404 INFO L280 TraceCheckUtils]: 24: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-10 20:21:16,404 INFO L280 TraceCheckUtils]: 25: Hoare triple {65#false} assume !(~i~0 < ~N~0); {65#false} is VALID [2020-07-10 20:21:16,405 INFO L280 TraceCheckUtils]: 26: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2020-07-10 20:21:16,405 INFO L280 TraceCheckUtils]: 27: Hoare triple {65#false} assume !!(~i~0 < ~N~0); {65#false} is VALID [2020-07-10 20:21:16,406 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:16,406 INFO L263 TraceCheckUtils]: 29: Hoare triple {65#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {65#false} is VALID [2020-07-10 20:21:16,407 INFO L280 TraceCheckUtils]: 30: Hoare triple {65#false} ~cond := #in~cond; {65#false} is VALID [2020-07-10 20:21:16,407 INFO L280 TraceCheckUtils]: 31: Hoare triple {65#false} assume 0 == ~cond; {65#false} is VALID [2020-07-10 20:21:16,407 INFO L280 TraceCheckUtils]: 32: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-10 20:21:16,413 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:16,413 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:16,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [680371405] [2020-07-10 20:21:16,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:16,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:16,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102807659] [2020-07-10 20:21:16,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:16,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:16,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:16,505 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:16,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:16,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:16,521 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2020-07-10 20:21:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:17,016 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2020-07-10 20:21:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:17,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-10 20:21:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-10 20:21:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2020-07-10 20:21:17,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2020-07-10 20:21:17,255 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:17,271 INFO L225 Difference]: With dead ends: 105 [2020-07-10 20:21:17,271 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 20:21:17,276 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:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 20:21:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 20:21:17,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:17,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:17,385 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:17,385 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:17,392 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:21:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:17,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:17,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:17,394 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:17,395 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 20:21:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:17,401 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 20:21:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:17,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:17,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:17,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:17,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:21:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-10 20:21:17,410 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 33 [2020-07-10 20:21:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:17,411 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-10 20:21:17,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:17,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-10 20:21:17,491 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:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 20:21:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:21:17,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:17,494 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:17,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:17,495 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1269072019, now seen corresponding path program 1 times [2020-07-10 20:21:17,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:17,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195216249] [2020-07-10 20:21:17,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:17,657 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:17,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-10 20:21:17,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-10 20:21:17,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-10 20:21:17,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:17,660 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-10 20:21:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:17,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-10 20:21:17,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-10 20:21:17,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:17,675 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:17,677 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:17,678 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:17,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {497#true} #valid := #valid[0 := 0]; {497#true} is VALID [2020-07-10 20:21:17,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {497#true} assume 0 < #StackHeapBarrier; {497#true} is VALID [2020-07-10 20:21:17,679 INFO L280 TraceCheckUtils]: 4: Hoare triple {497#true} ~N~0 := 0; {497#true} is VALID [2020-07-10 20:21:17,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:17,680 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {497#true} {497#true} #108#return; {497#true} is VALID [2020-07-10 20:21:17,680 INFO L263 TraceCheckUtils]: 7: Hoare triple {497#true} call #t~ret8 := main(); {497#true} is VALID [2020-07-10 20:21:17,681 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {497#true} is VALID [2020-07-10 20:21:17,681 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#true} ~N~0 := #t~nondet0; {497#true} is VALID [2020-07-10 20:21:17,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {497#true} havoc #t~nondet0; {497#true} is VALID [2020-07-10 20:21:17,683 INFO L280 TraceCheckUtils]: 11: Hoare triple {497#true} assume !(~N~0 <= 0); {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:17,683 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:17,684 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#true} ~cond := #in~cond; {497#true} is VALID [2020-07-10 20:21:17,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#true} assume !(0 == ~cond); {497#true} is VALID [2020-07-10 20:21:17,685 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#true} assume true; {497#true} is VALID [2020-07-10 20:21:17,687 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:17,688 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#(<= 1 ~N~0)} havoc ~i~0; {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:17,689 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:17,690 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:17,691 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:17,692 INFO L280 TraceCheckUtils]: 21: Hoare triple {505#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {505#(<= 1 ~N~0)} is VALID [2020-07-10 20:21:17,693 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:17,694 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:17,695 INFO L280 TraceCheckUtils]: 24: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-10 20:21:17,696 INFO L280 TraceCheckUtils]: 25: Hoare triple {498#false} assume !(~i~0 < ~N~0); {498#false} is VALID [2020-07-10 20:21:17,696 INFO L280 TraceCheckUtils]: 26: Hoare triple {498#false} ~i~0 := 0; {498#false} is VALID [2020-07-10 20:21:17,697 INFO L280 TraceCheckUtils]: 27: Hoare triple {498#false} assume !!(~i~0 < ~N~0); {498#false} is VALID [2020-07-10 20:21:17,697 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:17,698 INFO L263 TraceCheckUtils]: 29: Hoare triple {498#false} call __VERIFIER_assert((if 1 == #t~mem7 then 1 else 0)); {498#false} is VALID [2020-07-10 20:21:17,698 INFO L280 TraceCheckUtils]: 30: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2020-07-10 20:21:17,699 INFO L280 TraceCheckUtils]: 31: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2020-07-10 20:21:17,699 INFO L280 TraceCheckUtils]: 32: Hoare triple {498#false} assume !false; {498#false} is VALID [2020-07-10 20:21:17,702 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:17,703 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:17,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195216249] [2020-07-10 20:21:17,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:17,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:17,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10488806] [2020-07-10 20:21:17,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:17,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:17,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:17,760 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:17,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:17,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:17,762 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2020-07-10 20:21:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:18,468 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-07-10 20:21:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:18,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-10 20:21:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-10 20:21:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2020-07-10 20:21:18,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2020-07-10 20:21:18,650 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:18,657 INFO L225 Difference]: With dead ends: 92 [2020-07-10 20:21:18,657 INFO L226 Difference]: Without dead ends: 70 [2020-07-10 20:21:18,660 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:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-10 20:21:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-10 20:21:18,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:18,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:18,769 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-10 20:21:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:18,775 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 20:21:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-10 20:21:18,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:18,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:18,777 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-10 20:21:18,777 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-10 20:21:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:18,783 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 20:21:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-10 20:21:18,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:18,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:18,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:18,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:21:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-07-10 20:21:18,789 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 33 [2020-07-10 20:21:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:18,789 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-07-10 20:21:18,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:18,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2020-07-10 20:21:18,882 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:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 20:21:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 20:21:18,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:18,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] [2020-07-10 20:21:18,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:18,887 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1661969402, now seen corresponding path program 1 times [2020-07-10 20:21:18,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:18,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329079002] [2020-07-10 20:21:18,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:18,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:21:18,948 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:18,956 INFO L168 Benchmark]: Toolchain (without parser) took 4114.58 ms. Allocated memory was 144.2 MB in the beginning and 248.5 MB in the end (delta: 104.3 MB). Free memory was 102.0 MB in the beginning and 134.2 MB in the end (delta: -32.2 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:18,957 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 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:18,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.20 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 90.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:18,960 INFO L168 Benchmark]: Boogie Preprocessor took 162.45 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:18,960 INFO L168 Benchmark]: RCFGBuilder took 576.11 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 151.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:18,961 INFO L168 Benchmark]: TraceAbstraction took 3025.07 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 151.3 MB in the beginning and 134.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:18,966 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.35 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.20 ms. Allocated memory is still 144.2 MB. Free memory was 101.8 MB in the beginning and 90.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 162.45 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 90.8 MB in the beginning and 179.7 MB in the end (delta: -88.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 576.11 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 151.3 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3025.07 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 151.3 MB in the beginning and 134.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 63.2 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...