/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/ms5f.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-10 20:21:17,511 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-10 20:21:17,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 20:21:17,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 20:21:17,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 20:21:17,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 20:21:17,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 20:21:17,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 20:21:17,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 20:21:17,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 20:21:17,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 20:21:17,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 20:21:17,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 20:21:17,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 20:21:17,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 20:21:17,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 20:21:17,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 20:21:17,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 20:21:17,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 20:21:17,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 20:21:17,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 20:21:17,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 20:21:17,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 20:21:17,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 20:21:17,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 20:21:17,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 20:21:17,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 20:21:17,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 20:21:17,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 20:21:17,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 20:21:17,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 20:21:17,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 20:21:17,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 20:21:17,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 20:21:17,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 20:21:17,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 20:21:17,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 20:21:17,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 20:21:17,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 20:21:17,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 20:21:17,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 20:21:17,564 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:17,574 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-10 20:21:17,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 20:21:17,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 20:21:17,576 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-10 20:21:17,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-10 20:21:17,576 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-10 20:21:17,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-10 20:21:17,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 20:21:17,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 20:21:17,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 20:21:17,577 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-10 20:21:17,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-10 20:21:17,577 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-10 20:21:17,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-10 20:21:17,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 20:21:17,578 INFO L138 SettingsManager]: * Size of a code block=SingleStatement
[2020-07-10 20:21:17,578 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-10 20:21:17,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-10 20:21:17,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 20:21:17,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 20:21:17,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-10 20:21:17,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 20:21:17,580 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
[2020-07-10 20:21:17,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 20:21:17,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 20:21:17,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 20:21:17,912 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-10 20:21:17,913 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-10 20:21:17,914 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms5f.c
[2020-07-10 20:21:18,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f55775be/e8ffd48be4184ae194c1a868f6f7e47f/FLAG69a46c2eb
[2020-07-10 20:21:18,530 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-10 20:21:18,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms5f.c
[2020-07-10 20:21:18,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f55775be/e8ffd48be4184ae194c1a868f6f7e47f/FLAG69a46c2eb
[2020-07-10 20:21:18,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f55775be/e8ffd48be4184ae194c1a868f6f7e47f
[2020-07-10 20:21:18,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 20:21:18,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 20:21:18,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 20:21:18,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 20:21:18,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 20:21:18,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:18" (1/1) ...
[2020-07-10 20:21:18,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b6e84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:18, skipping insertion in model container
[2020-07-10 20:21:18,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:18" (1/1) ...
[2020-07-10 20:21:18,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-10 20:21:18,966 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-10 20:21:19,162 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 20:21:19,174 INFO L203 MainTranslator]: Completed pre-run
[2020-07-10 20:21:19,196 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 20:21:19,215 INFO L208 MainTranslator]: Completed translation
[2020-07-10 20:21:19,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:19 WrapperNode
[2020-07-10 20:21:19,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 20:21:19,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 20:21:19,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 20:21:19,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 20:21:19,326 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:19" (1/1) ...
[2020-07-10 20:21:19,326 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:19" (1/1) ...
[2020-07-10 20:21:19,340 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:19" (1/1) ...
[2020-07-10 20:21:19,340 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:19" (1/1) ...
[2020-07-10 20:21:19,362 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:19" (1/1) ...
[2020-07-10 20:21:19,371 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:19" (1/1) ...
[2020-07-10 20:21:19,373 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:19" (1/1) ...
[2020-07-10 20:21:19,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 20:21:19,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 20:21:19,377 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 20:21:19,377 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-10 20:21:19,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:19" (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:19,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 20:21:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 20:21:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-10 20:21:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-10 20:21:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 20:21:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 20:21:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 20:21:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-10 20:21:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 20:21:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 20:21:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2020-07-10 20:21:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-10 20:21:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-07-10 20:21:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-10 20:21:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-07-10 20:21:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2020-07-10 20:21:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-10 20:21:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 20:21:19,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 20:21:19,869 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 20:21:19,869 INFO L295 CfgBuilder]: Removed 2 assume(true) statements.
[2020-07-10 20:21:19,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:19 BoogieIcfgContainer
[2020-07-10 20:21:19,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 20:21:19,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 20:21:19,877 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 20:21:19,887 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-10 20:21:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:18" (1/3) ...
[2020-07-10 20:21:19,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72609896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:19, skipping insertion in model container
[2020-07-10 20:21:19,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:19" (2/3) ...
[2020-07-10 20:21:19,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72609896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:19, skipping insertion in model container
[2020-07-10 20:21:19,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:19" (3/3) ...
[2020-07-10 20:21:19,893 INFO L109 eAbstractionObserver]: Analyzing ICFG ms5f.c
[2020-07-10 20:21:19,909 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-10 20:21:19,918 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 20:21:19,932 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 20:21:19,953 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-10 20:21:19,953 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-10 20:21:19,954 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-07-10 20:21:19,954 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 20:21:19,954 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 20:21:19,955 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-10 20:21:19,955 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 20:21:19,955 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 20:21:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states.
[2020-07-10 20:21:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2020-07-10 20:21:19,984 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 20:21:19,985 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]
[2020-07-10 20:21:19,986 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:21:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:21:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash -845632023, now seen corresponding path program 1 times
[2020-07-10 20:21:20,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:21:20,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846297995]
[2020-07-10 20:21:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:21:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:20,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(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; {60#true} is VALID
[2020-07-10 20:21:20,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID
[2020-07-10 20:21:20,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID
[2020-07-10 20:21:20,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID
[2020-07-10 20:21:20,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} assume true; {60#true} is VALID
[2020-07-10 20:21:20,278 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID
[2020-07-10 20:21:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:20,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID
[2020-07-10 20:21:20,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID
[2020-07-10 20:21:20,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID
[2020-07-10 20:21:20,311 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID
[2020-07-10 20:21:20,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {72#(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:20,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(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; {60#true} is VALID
[2020-07-10 20:21:20,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID
[2020-07-10 20:21:20,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID
[2020-07-10 20:21:20,316 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID
[2020-07-10 20:21:20,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#true} assume true; {60#true} is VALID
[2020-07-10 20:21:20,317 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID
[2020-07-10 20:21:20,317 INFO L263 TraceCheckUtils]: 7: Hoare triple {60#true} call #t~ret7 := main(); {60#true} is VALID
[2020-07-10 20:21:20,317 INFO L280 TraceCheckUtils]: 8: Hoare triple {60#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {60#true} is VALID
[2020-07-10 20:21:20,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {60#true} ~N~0 := #t~nondet0; {60#true} is VALID
[2020-07-10 20:21:20,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {60#true} havoc #t~nondet0; {60#true} is VALID
[2020-07-10 20:21:20,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {60#true} assume !(~N~0 <= 0); {60#true} is VALID
[2020-07-10 20:21:20,320 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {60#true} is VALID
[2020-07-10 20:21:20,320 INFO L280 TraceCheckUtils]: 13: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID
[2020-07-10 20:21:20,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID
[2020-07-10 20:21:20,321 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#true} assume true; {60#true} is VALID
[2020-07-10 20:21:20,323 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID
[2020-07-10 20:21:20,323 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#true} havoc ~i~0; {60#true} is VALID
[2020-07-10 20:21:20,324 INFO L280 TraceCheckUtils]: 18: Hoare triple {60#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {60#true} is VALID
[2020-07-10 20:21:20,325 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {60#true} is VALID
[2020-07-10 20:21:20,326 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {60#true} is VALID
[2020-07-10 20:21:20,326 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#true} ~i~0 := 0; {60#true} is VALID
[2020-07-10 20:21:20,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#true} assume !true; {61#false} is VALID
[2020-07-10 20:21:20,328 INFO L280 TraceCheckUtils]: 23: Hoare triple {61#false} ~i~0 := 0; {61#false} is VALID
[2020-07-10 20:21:20,329 INFO L280 TraceCheckUtils]: 24: Hoare triple {61#false} assume !true; {61#false} is VALID
[2020-07-10 20:21:20,329 INFO L280 TraceCheckUtils]: 25: Hoare triple {61#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {61#false} is VALID
[2020-07-10 20:21:20,329 INFO L263 TraceCheckUtils]: 26: Hoare triple {61#false} call __VERIFIER_assert((if #t~mem6 > 4 * ~N~0 then 1 else 0)); {61#false} is VALID
[2020-07-10 20:21:20,330 INFO L280 TraceCheckUtils]: 27: Hoare triple {61#false} ~cond := #in~cond; {61#false} is VALID
[2020-07-10 20:21:20,331 INFO L280 TraceCheckUtils]: 28: Hoare triple {61#false} assume 0 == ~cond; {61#false} is VALID
[2020-07-10 20:21:20,331 INFO L280 TraceCheckUtils]: 29: Hoare triple {61#false} assume !false; {61#false} is VALID
[2020-07-10 20:21:20,341 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:20,342 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 20:21:20,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846297995]
[2020-07-10 20:21:20,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 20:21:20,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-10 20:21:20,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135271211]
[2020-07-10 20:21:20,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2020-07-10 20:21:20,363 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 20:21:20,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-10 20:21:20,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-10 20:21:20,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 20:21:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-10 20:21:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-10 20:21:20,472 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states.
[2020-07-10 20:21:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:20,973 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions.
[2020-07-10 20:21:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-07-10 20:21:20,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30
[2020-07-10 20:21:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 20:21:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 20:21:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions.
[2020-07-10 20:21:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 20:21:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions.
[2020-07-10 20:21:21,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions.
[2020-07-10 20:21:21,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:21,194 INFO L225 Difference]: With dead ends: 97
[2020-07-10 20:21:21,194 INFO L226 Difference]: Without dead ends: 45
[2020-07-10 20:21:21,198 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:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2020-07-10 20:21:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2020-07-10 20:21:21,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 20:21:21,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states.
[2020-07-10 20:21:21,293 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states.
[2020-07-10 20:21:21,293 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states.
[2020-07-10 20:21:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:21,299 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions.
[2020-07-10 20:21:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions.
[2020-07-10 20:21:21,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:21:21,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:21:21,301 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states.
[2020-07-10 20:21:21,301 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states.
[2020-07-10 20:21:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:21,307 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions.
[2020-07-10 20:21:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions.
[2020-07-10 20:21:21,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:21:21,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:21:21,309 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 20:21:21,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 20:21:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2020-07-10 20:21:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions.
[2020-07-10 20:21:21,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30
[2020-07-10 20:21:21,316 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 20:21:21,316 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions.
[2020-07-10 20:21:21,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-10 20:21:21,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 47 transitions.
[2020-07-10 20:21:21,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions.
[2020-07-10 20:21:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2020-07-10 20:21:21,385 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 20:21:21,385 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]
[2020-07-10 20:21:21,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 20:21:21,386 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:21:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:21:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 104990277, now seen corresponding path program 1 times
[2020-07-10 20:21:21,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:21:21,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955152643]
[2020-07-10 20:21:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:21:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:21,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(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; {449#true} is VALID
[2020-07-10 20:21:21,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID
[2020-07-10 20:21:21,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID
[2020-07-10 20:21:21,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID
[2020-07-10 20:21:21,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} assume true; {449#true} is VALID
[2020-07-10 20:21:21,511 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID
[2020-07-10 20:21:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:21:21,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID
[2020-07-10 20:21:21,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID
[2020-07-10 20:21:21,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID
[2020-07-10 20:21:21,523 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,525 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {463#(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:21,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(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; {449#true} is VALID
[2020-07-10 20:21:21,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID
[2020-07-10 20:21:21,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID
[2020-07-10 20:21:21,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID
[2020-07-10 20:21:21,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {449#true} assume true; {449#true} is VALID
[2020-07-10 20:21:21,527 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID
[2020-07-10 20:21:21,528 INFO L263 TraceCheckUtils]: 7: Hoare triple {449#true} call #t~ret7 := main(); {449#true} is VALID
[2020-07-10 20:21:21,528 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {449#true} is VALID
[2020-07-10 20:21:21,529 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#true} ~N~0 := #t~nondet0; {449#true} is VALID
[2020-07-10 20:21:21,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {449#true} havoc #t~nondet0; {449#true} is VALID
[2020-07-10 20:21:21,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} assume !(~N~0 <= 0); {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,531 INFO L263 TraceCheckUtils]: 12: Hoare triple {457#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {449#true} is VALID
[2020-07-10 20:21:21,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID
[2020-07-10 20:21:21,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID
[2020-07-10 20:21:21,532 INFO L280 TraceCheckUtils]: 15: Hoare triple {449#true} assume true; {449#true} is VALID
[2020-07-10 20:21:21,533 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {457#(<= 1 ~N~0)} havoc ~i~0; {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {457#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {457#(<= 1 ~N~0)} is VALID
[2020-07-10 20:21:21,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {457#(<= 1 ~N~0)} ~i~0 := 0; {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID
[2020-07-10 20:21:21,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {450#false} is VALID
[2020-07-10 20:21:21,541 INFO L280 TraceCheckUtils]: 23: Hoare triple {450#false} ~i~0 := 0; {450#false} is VALID
[2020-07-10 20:21:21,541 INFO L280 TraceCheckUtils]: 24: Hoare triple {450#false} assume !(~i~0 < ~N~0); {450#false} is VALID
[2020-07-10 20:21:21,542 INFO L280 TraceCheckUtils]: 25: Hoare triple {450#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {450#false} is VALID
[2020-07-10 20:21:21,542 INFO L263 TraceCheckUtils]: 26: Hoare triple {450#false} call __VERIFIER_assert((if #t~mem6 > 4 * ~N~0 then 1 else 0)); {450#false} is VALID
[2020-07-10 20:21:21,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID
[2020-07-10 20:21:21,543 INFO L280 TraceCheckUtils]: 28: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID
[2020-07-10 20:21:21,543 INFO L280 TraceCheckUtils]: 29: Hoare triple {450#false} assume !false; {450#false} is VALID
[2020-07-10 20:21:21,545 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:21,545 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 20:21:21,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955152643]
[2020-07-10 20:21:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 20:21:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-10 20:21:21,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993737633]
[2020-07-10 20:21:21,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30
[2020-07-10 20:21:21,548 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 20:21:21,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-10 20:21:21,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:21,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-10 20:21:21,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 20:21:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-10 20:21:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-07-10 20:21:21,593 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states.
[2020-07-10 20:21:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:22,041 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions.
[2020-07-10 20:21:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-10 20:21:22,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30
[2020-07-10 20:21:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 20:21:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 20:21:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions.
[2020-07-10 20:21:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 20:21:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions.
[2020-07-10 20:21:22,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions.
[2020-07-10 20:21:22,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:22,159 INFO L225 Difference]: With dead ends: 71
[2020-07-10 20:21:22,159 INFO L226 Difference]: Without dead ends: 53
[2020-07-10 20:21:22,161 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:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2020-07-10 20:21:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48.
[2020-07-10 20:21:22,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 20:21:22,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states.
[2020-07-10 20:21:22,235 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states.
[2020-07-10 20:21:22,235 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states.
[2020-07-10 20:21:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:22,239 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions.
[2020-07-10 20:21:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2020-07-10 20:21:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:21:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:21:22,240 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states.
[2020-07-10 20:21:22,240 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states.
[2020-07-10 20:21:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:21:22,244 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions.
[2020-07-10 20:21:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2020-07-10 20:21:22,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:21:22,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:21:22,246 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 20:21:22,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 20:21:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2020-07-10 20:21:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions.
[2020-07-10 20:21:22,250 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30
[2020-07-10 20:21:22,250 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 20:21:22,250 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions.
[2020-07-10 20:21:22,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-10 20:21:22,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 50 transitions.
[2020-07-10 20:21:22,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 20:21:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions.
[2020-07-10 20:21:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2020-07-10 20:21:22,331 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 20:21:22,331 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]
[2020-07-10 20:21:22,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 20:21:22,334 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:21:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:21:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1687643347, now seen corresponding path program 1 times
[2020-07-10 20:21:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:21:22,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230129645]
[2020-07-10 20:21:22,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:21:22,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-10 20:21:22,365 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.<init>(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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(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.<init>(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:22,372 INFO L168 Benchmark]: Toolchain (without parser) took 3450.54 ms. Allocated memory was 134.2 MB in the beginning and 256.4 MB in the end (delta: 122.2 MB). Free memory was 99.6 MB in the beginning and 186.4 MB in the end (delta: -86.9 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB.
[2020-07-10 20:21:22,373 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-10 20:21:22,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.15 ms. Allocated memory is still 134.2 MB. Free memory was 99.4 MB in the beginning and 88.4 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:22,375 INFO L168 Benchmark]: Boogie Preprocessor took 159.62 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 88.4 MB in the beginning and 177.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB.
[2020-07-10 20:21:22,376 INFO L168 Benchmark]: RCFGBuilder took 498.50 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 150.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
[2020-07-10 20:21:22,377 INFO L168 Benchmark]: TraceAbstraction took 2491.89 ms. Allocated memory was 199.8 MB in the beginning and 256.4 MB in the end (delta: 56.6 MB). Free memory was 150.0 MB in the beginning and 186.4 MB in the end (delta: -36.4 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB.
[2020-07-10 20:21:22,381 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.22 ms. Allocated memory is still 134.2 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 292.15 ms. Allocated memory is still 134.2 MB. Free memory was 99.4 MB in the beginning and 88.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 159.62 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 88.4 MB in the beginning and 177.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 498.50 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 150.0 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 2491.89 ms. Allocated memory was 199.8 MB in the beginning and 256.4 MB in the end (delta: 56.6 MB). Free memory was 150.0 MB in the beginning and 186.4 MB in the end (delta: -36.4 MB). Peak memory consumption was 20.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...