/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/indp1f.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-8fc6572
[2020-07-10 15:26:20,984 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-10 15:26:20,987 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 15:26:21,005 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 15:26:21,006 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 15:26:21,008 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 15:26:21,009 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 15:26:21,023 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 15:26:21,025 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 15:26:21,026 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 15:26:21,027 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 15:26:21,028 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 15:26:21,028 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 15:26:21,032 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 15:26:21,034 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 15:26:21,036 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 15:26:21,038 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 15:26:21,039 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 15:26:21,041 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 15:26:21,047 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 15:26:21,049 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 15:26:21,050 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 15:26:21,053 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 15:26:21,053 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 15:26:21,057 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 15:26:21,057 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 15:26:21,057 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 15:26:21,060 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 15:26:21,061 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 15:26:21,062 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 15:26:21,062 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 15:26:21,062 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 15:26:21,064 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 15:26:21,065 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 15:26:21,067 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 15:26:21,067 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 15:26:21,070 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 15:26:21,070 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 15:26:21,070 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 15:26:21,071 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 15:26:21,072 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 15:26:21,073 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-10 15:26:21,096 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-10 15:26:21,097 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 15:26:21,099 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-10 15:26:21,099 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-07-10 15:26:21,100 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-07-10 15:26:21,100 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 15:26:21,100 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-10 15:26:21,100 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-10 15:26:21,101 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-10 15:26:21,101 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-10 15:26:21,102 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 15:26:21,102 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 15:26:21,102 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 15:26:21,103 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-10 15:26:21,103 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-10 15:26:21,103 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-10 15:26:21,103 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-10 15:26:21,104 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 15:26:21,104 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-07-10 15:26:21,104 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-10 15:26:21,104 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-10 15:26:21,104 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:26:21,105 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 15:26:21,105 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-07-10 15:26:21,105 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-10 15:26:21,105 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-07-10 15:26:21,105 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-10 15:26:21,106 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 15:26:21,106 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-07-10 15:26:21,106 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-10 15:26:21,417 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 15:26:21,437 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 15:26:21,440 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 15:26:21,442 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-10 15:26:21,442 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-10 15:26:21,443 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp1f.c
[2020-07-10 15:26:21,519 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ec295ad/ff20390f49f0450a8da0e6c57419101a/FLAGcdd1a205c
[2020-07-10 15:26:21,977 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-10 15:26:21,978 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp1f.c
[2020-07-10 15:26:21,985 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ec295ad/ff20390f49f0450a8da0e6c57419101a/FLAGcdd1a205c
[2020-07-10 15:26:22,348 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ec295ad/ff20390f49f0450a8da0e6c57419101a
[2020-07-10 15:26:22,358 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 15:26:22,360 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 15:26:22,362 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 15:26:22,362 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 15:26:22,365 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 15:26:22,367 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,370 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a9796e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22, skipping insertion in model container
[2020-07-10 15:26:22,370 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,378 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-10 15:26:22,394 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-10 15:26:22,564 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:26:22,577 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-10 15:26:22,600 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:26:22,617 INFO  L208         MainTranslator]: Completed translation
[2020-07-10 15:26:22,617 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22 WrapperNode
[2020-07-10 15:26:22,617 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 15:26:22,618 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 15:26:22,618 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 15:26:22,618 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 15:26:22,715 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,716 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,724 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,725 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,748 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,757 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,764 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
[2020-07-10 15:26:22,768 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 15:26:22,769 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 15:26:22,769 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 15:26:22,769 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-10 15:26:22,770 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:26:22,830 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 15:26:22,830 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 15:26:22,830 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-10 15:26:22,830 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-10 15:26:22,831 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 15:26:22,831 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 15:26:22,831 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 15:26:22,831 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-10 15:26:22,831 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-07-10 15:26:22,832 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-07-10 15:26:22,833 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 15:26:22,833 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 15:26:22,833 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-10 15:26:23,240 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 15:26:23,240 INFO  L295             CfgBuilder]: Removed 4 assume(true) statements.
[2020-07-10 15:26:23,243 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:23 BoogieIcfgContainer
[2020-07-10 15:26:23,244 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 15:26:23,245 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 15:26:23,245 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 15:26:23,248 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-10 15:26:23,248 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:22" (1/3) ...
[2020-07-10 15:26:23,249 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654df555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:23, skipping insertion in model container
[2020-07-10 15:26:23,249 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:22" (2/3) ...
[2020-07-10 15:26:23,250 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654df555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:23, skipping insertion in model container
[2020-07-10 15:26:23,250 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:23" (3/3) ...
[2020-07-10 15:26:23,252 INFO  L109   eAbstractionObserver]: Analyzing ICFG indp1f.c
[2020-07-10 15:26:23,262 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-10 15:26:23,270 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 15:26:23,282 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 15:26:23,303 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-10 15:26:23,303 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-10 15:26:23,303 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-10 15:26:23,303 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 15:26:23,303 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 15:26:23,303 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-10 15:26:23,303 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 15:26:23,303 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 15:26:23,318 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states.
[2020-07-10 15:26:23,323 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-07-10 15:26:23,324 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 15:26:23,324 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]
[2020-07-10 15:26:23,325 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:23,329 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:23,329 INFO  L82        PathProgramCache]: Analyzing trace with hash 1155719453, now seen corresponding path program 1 times
[2020-07-10 15:26:23,338 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:23,338 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111340069]
[2020-07-10 15:26:23,339 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:23,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:23,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:23,551 INFO  L280        TraceCheckUtils]: 0: Hoare triple {49#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {40#true} is VALID
[2020-07-10 15:26:23,551 INFO  L280        TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID
[2020-07-10 15:26:23,552 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID
[2020-07-10 15:26:23,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:23,562 INFO  L280        TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2020-07-10 15:26:23,563 INFO  L280        TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2020-07-10 15:26:23,564 INFO  L280        TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2020-07-10 15:26:23,564 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID
[2020-07-10 15:26:23,566 INFO  L263        TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 15:26:23,566 INFO  L280        TraceCheckUtils]: 1: Hoare triple {49#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {40#true} is VALID
[2020-07-10 15:26:23,567 INFO  L280        TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID
[2020-07-10 15:26:23,567 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID
[2020-07-10 15:26:23,568 INFO  L263        TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID
[2020-07-10 15:26:23,568 INFO  L280        TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {40#true} is VALID
[2020-07-10 15:26:23,569 INFO  L280        TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID
[2020-07-10 15:26:23,569 INFO  L263        TraceCheckUtils]: 7: Hoare triple {40#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {40#true} is VALID
[2020-07-10 15:26:23,569 INFO  L280        TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2020-07-10 15:26:23,570 INFO  L280        TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2020-07-10 15:26:23,571 INFO  L280        TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID
[2020-07-10 15:26:23,571 INFO  L275        TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID
[2020-07-10 15:26:23,572 INFO  L280        TraceCheckUtils]: 12: Hoare triple {41#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {41#false} is VALID
[2020-07-10 15:26:23,572 INFO  L280        TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID
[2020-07-10 15:26:23,573 INFO  L280        TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID
[2020-07-10 15:26:23,573 INFO  L280        TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID
[2020-07-10 15:26:23,574 INFO  L280        TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID
[2020-07-10 15:26:23,574 INFO  L280        TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID
[2020-07-10 15:26:23,575 INFO  L280        TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID
[2020-07-10 15:26:23,575 INFO  L280        TraceCheckUtils]: 19: Hoare triple {41#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {41#false} is VALID
[2020-07-10 15:26:23,575 INFO  L263        TraceCheckUtils]: 20: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 then 1 else 0)); {41#false} is VALID
[2020-07-10 15:26:23,576 INFO  L280        TraceCheckUtils]: 21: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID
[2020-07-10 15:26:23,576 INFO  L280        TraceCheckUtils]: 22: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID
[2020-07-10 15:26:23,577 INFO  L280        TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID
[2020-07-10 15:26:23,580 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 15:26:23,581 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111340069]
[2020-07-10 15:26:23,582 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 15:26:23,583 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-10 15:26:23,584 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033598718]
[2020-07-10 15:26:23,590 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2020-07-10 15:26:23,593 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:26:23,597 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-10 15:26:23,645 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 15:26:23,645 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-10 15:26:23,645 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:26:23,654 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-10 15:26:23,655 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-10 15:26:23,658 INFO  L87              Difference]: Start difference. First operand 37 states. Second operand 3 states.
[2020-07-10 15:26:23,860 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:23,861 INFO  L93              Difference]: Finished difference Result 64 states and 83 transitions.
[2020-07-10 15:26:23,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-07-10 15:26:23,861 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2020-07-10 15:26:23,862 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:26:23,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 15:26:23,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions.
[2020-07-10 15:26:23,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-10 15:26:23,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions.
[2020-07-10 15:26:23,880 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions.
[2020-07-10 15:26:24,034 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 15:26:24,047 INFO  L225             Difference]: With dead ends: 64
[2020-07-10 15:26:24,047 INFO  L226             Difference]: Without dead ends: 32
[2020-07-10 15:26:24,051 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 15:26:24,071 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2020-07-10 15:26:24,116 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2020-07-10 15:26:24,116 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:26:24,117 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states.
[2020-07-10 15:26:24,118 INFO  L74              IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states.
[2020-07-10 15:26:24,118 INFO  L87              Difference]: Start difference. First operand 32 states. Second operand 32 states.
[2020-07-10 15:26:24,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:24,125 INFO  L93              Difference]: Finished difference Result 32 states and 35 transitions.
[2020-07-10 15:26:24,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2020-07-10 15:26:24,126 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:24,127 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:24,127 INFO  L74              IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states.
[2020-07-10 15:26:24,127 INFO  L87              Difference]: Start difference. First operand 32 states. Second operand 32 states.
[2020-07-10 15:26:24,137 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:24,137 INFO  L93              Difference]: Finished difference Result 32 states and 35 transitions.
[2020-07-10 15:26:24,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2020-07-10 15:26:24,138 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:24,138 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:24,139 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:26:24,139 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:26:24,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2020-07-10 15:26:24,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions.
[2020-07-10 15:26:24,148 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24
[2020-07-10 15:26:24,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:26:24,149 INFO  L479      AbstractCegarLoop]: Abstraction has 32 states and 35 transitions.
[2020-07-10 15:26:24,152 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-10 15:26:24,153 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions.
[2020-07-10 15:26:24,154 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-07-10 15:26:24,155 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 15:26:24,161 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]
[2020-07-10 15:26:24,162 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 15:26:24,162 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:24,163 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:24,163 INFO  L82        PathProgramCache]: Analyzing trace with hash -124144225, now seen corresponding path program 1 times
[2020-07-10 15:26:24,163 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:24,164 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502070458]
[2020-07-10 15:26:24,164 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:24,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:24,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:24,295 INFO  L280        TraceCheckUtils]: 0: Hoare triple {253#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {242#true} is VALID
[2020-07-10 15:26:24,296 INFO  L280        TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID
[2020-07-10 15:26:24,296 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {242#true} {242#true} #95#return; {242#true} is VALID
[2020-07-10 15:26:24,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:26:24,305 INFO  L280        TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID
[2020-07-10 15:26:24,305 INFO  L280        TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID
[2020-07-10 15:26:24,305 INFO  L280        TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID
[2020-07-10 15:26:24,307 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {242#true} {247#(<= 1 ~N~0)} #91#return; {247#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:24,308 INFO  L263        TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {253#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 15:26:24,308 INFO  L280        TraceCheckUtils]: 1: Hoare triple {253#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {242#true} is VALID
[2020-07-10 15:26:24,308 INFO  L280        TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID
[2020-07-10 15:26:24,309 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #95#return; {242#true} is VALID
[2020-07-10 15:26:24,309 INFO  L263        TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret9 := main(); {242#true} is VALID
[2020-07-10 15:26:24,309 INFO  L280        TraceCheckUtils]: 5: Hoare triple {242#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {242#true} is VALID
[2020-07-10 15:26:24,310 INFO  L280        TraceCheckUtils]: 6: Hoare triple {242#true} assume !(~N~0 <= 0); {247#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:24,311 INFO  L263        TraceCheckUtils]: 7: Hoare triple {247#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {242#true} is VALID
[2020-07-10 15:26:24,311 INFO  L280        TraceCheckUtils]: 8: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID
[2020-07-10 15:26:24,311 INFO  L280        TraceCheckUtils]: 9: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID
[2020-07-10 15:26:24,312 INFO  L280        TraceCheckUtils]: 10: Hoare triple {242#true} assume true; {242#true} is VALID
[2020-07-10 15:26:24,313 INFO  L275        TraceCheckUtils]: 11: Hoare quadruple {242#true} {247#(<= 1 ~N~0)} #91#return; {247#(<= 1 ~N~0)} is VALID
[2020-07-10 15:26:24,314 INFO  L280        TraceCheckUtils]: 12: Hoare triple {247#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {252#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID
[2020-07-10 15:26:24,315 INFO  L280        TraceCheckUtils]: 13: Hoare triple {252#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {243#false} is VALID
[2020-07-10 15:26:24,315 INFO  L280        TraceCheckUtils]: 14: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID
[2020-07-10 15:26:24,316 INFO  L280        TraceCheckUtils]: 15: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID
[2020-07-10 15:26:24,316 INFO  L280        TraceCheckUtils]: 16: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID
[2020-07-10 15:26:24,316 INFO  L280        TraceCheckUtils]: 17: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID
[2020-07-10 15:26:24,316 INFO  L280        TraceCheckUtils]: 18: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID
[2020-07-10 15:26:24,317 INFO  L280        TraceCheckUtils]: 19: Hoare triple {243#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {243#false} is VALID
[2020-07-10 15:26:24,317 INFO  L263        TraceCheckUtils]: 20: Hoare triple {243#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 then 1 else 0)); {243#false} is VALID
[2020-07-10 15:26:24,317 INFO  L280        TraceCheckUtils]: 21: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID
[2020-07-10 15:26:24,318 INFO  L280        TraceCheckUtils]: 22: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID
[2020-07-10 15:26:24,318 INFO  L280        TraceCheckUtils]: 23: Hoare triple {243#false} assume !false; {243#false} is VALID
[2020-07-10 15:26:24,319 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 15:26:24,320 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502070458]
[2020-07-10 15:26:24,320 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 15:26:24,320 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-10 15:26:24,320 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614368547]
[2020-07-10 15:26:24,322 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 24
[2020-07-10 15:26:24,323 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:26:24,323 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-10 15:26:24,358 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 15:26:24,358 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-10 15:26:24,358 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:26:24,359 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-10 15:26:24,359 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-07-10 15:26:24,359 INFO  L87              Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states.
[2020-07-10 15:26:24,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:24,657 INFO  L93              Difference]: Finished difference Result 59 states and 68 transitions.
[2020-07-10 15:26:24,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-07-10 15:26:24,657 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 24
[2020-07-10 15:26:24,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:26:24,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 15:26:24,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions.
[2020-07-10 15:26:24,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 15:26:24,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions.
[2020-07-10 15:26:24,666 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions.
[2020-07-10 15:26:24,763 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 15:26:24,766 INFO  L225             Difference]: With dead ends: 59
[2020-07-10 15:26:24,766 INFO  L226             Difference]: Without dead ends: 42
[2020-07-10 15:26:24,768 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 15:26:24,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2020-07-10 15:26:24,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35.
[2020-07-10 15:26:24,808 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:26:24,808 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states.
[2020-07-10 15:26:24,809 INFO  L74              IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states.
[2020-07-10 15:26:24,809 INFO  L87              Difference]: Start difference. First operand 42 states. Second operand 35 states.
[2020-07-10 15:26:24,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:24,814 INFO  L93              Difference]: Finished difference Result 42 states and 46 transitions.
[2020-07-10 15:26:24,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions.
[2020-07-10 15:26:24,815 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:24,816 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:24,816 INFO  L74              IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states.
[2020-07-10 15:26:24,816 INFO  L87              Difference]: Start difference. First operand 35 states. Second operand 42 states.
[2020-07-10 15:26:24,820 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:26:24,820 INFO  L93              Difference]: Finished difference Result 42 states and 46 transitions.
[2020-07-10 15:26:24,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions.
[2020-07-10 15:26:24,821 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:26:24,821 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:26:24,822 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:26:24,822 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:26:24,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2020-07-10 15:26:24,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions.
[2020-07-10 15:26:24,825 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24
[2020-07-10 15:26:24,825 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:26:24,826 INFO  L479      AbstractCegarLoop]: Abstraction has 35 states and 38 transitions.
[2020-07-10 15:26:24,826 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-10 15:26:24,826 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions.
[2020-07-10 15:26:24,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2020-07-10 15:26:24,827 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 15:26:24,827 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 15:26:24,828 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 15:26:24,828 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:26:24,828 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:26:24,829 INFO  L82        PathProgramCache]: Analyzing trace with hash -191015719, now seen corresponding path program 1 times
[2020-07-10 15:26:24,829 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:26:24,829 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755727325]
[2020-07-10 15:26:24,829 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:26:24,845 ERROR L271   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2020-07-10 15:26:24,845 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042514301]
[2020-07-10 15:26:24,846 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:26:24,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 15:26:24,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 15:26:24,998 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-10 15:26:24,998 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-07-10 15:26:25,214 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2020-07-10 15:26:25,249 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2020-07-10 15:26:25,250 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L11 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L11 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L22 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L22 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 15:26:25,251 WARN  L170   areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: L11-2 has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:26:25,252 WARN  L170   areAnnotationChecker]: L13-1 has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: L13-1 has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: L13-3 has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: L23-1 has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:25,253 WARN  L170   areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L28-3 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L45-1 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L28-4 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L28-2 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L43-2 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:25,254 WARN  L170   areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L33-3 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L43-3 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L43-3 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L43-3 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L33-4 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L33-2 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L43-4 has no Hoare annotation
[2020-07-10 15:26:25,255 WARN  L170   areAnnotationChecker]: L45 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L45 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L38-3 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L38-3 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L38-3 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L38-4 has no Hoare annotation
[2020-07-10 15:26:25,256 WARN  L170   areAnnotationChecker]: L38-2 has no Hoare annotation
[2020-07-10 15:26:25,256 INFO  L163   areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-10 15:26:25,259 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:25 BoogieIcfgContainer
[2020-07-10 15:26:25,259 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-10 15:26:25,263 INFO  L168              Benchmark]: Toolchain (without parser) took 2902.00 ms. Allocated memory was 148.4 MB in the beginning and 240.6 MB in the end (delta: 92.3 MB). Free memory was 106.2 MB in the beginning and 201.3 MB in the end (delta: -95.0 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,264 INFO  L168              Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 148.4 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,264 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 256.28 ms. Allocated memory is still 148.4 MB. Free memory was 106.0 MB in the beginning and 95.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,265 INFO  L168              Benchmark]: Boogie Preprocessor took 150.39 ms. Allocated memory was 148.4 MB in the beginning and 203.4 MB in the end (delta: 55.1 MB). Free memory was 95.0 MB in the beginning and 181.1 MB in the end (delta: -86.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,266 INFO  L168              Benchmark]: RCFGBuilder took 474.94 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 156.2 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,267 INFO  L168              Benchmark]: TraceAbstraction took 2014.65 ms. Allocated memory was 203.4 MB in the beginning and 240.6 MB in the end (delta: 37.2 MB). Free memory was 155.6 MB in the beginning and 201.3 MB in the end (delta: -45.6 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-10 15:26:25,271 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.52 ms. Allocated memory is still 148.4 MB. Free memory was 124.6 MB in the beginning and 124.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 256.28 ms. Allocated memory is still 148.4 MB. Free memory was 106.0 MB in the beginning and 95.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 150.39 ms. Allocated memory was 148.4 MB in the beginning and 203.4 MB in the end (delta: 55.1 MB). Free memory was 95.0 MB in the beginning and 181.1 MB in the end (delta: -86.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 474.94 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 156.2 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 2014.65 ms. Allocated memory was 203.4 MB in the beginning and 240.6 MB in the end (delta: 37.2 MB). Free memory was 155.6 MB in the beginning and 201.3 MB in the end (delta: -45.6 MB). There was no memory consumed. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L17]              int N;
       VAL         [\old(N)=2, N=0]
[L21]              N = __VERIFIER_nondet_int()
[L22]  COND FALSE  !(N <= 0)
       VAL         [\old(N)=0, N=1]
[L23]  CALL        assume_abort_if_not(N <= 2147483647/sizeof(int))
       VAL         [\old(cond)=1, \old(N)=0, N=1]
[L11]  COND FALSE  !(!cond)
       VAL         [\old(cond)=1, \old(N)=0, cond=1, N=1]
[L23]  RET         assume_abort_if_not(N <= 2147483647/sizeof(int))
       VAL         [\old(N)=0, N=1]
[L25]              int i;
[L26]              long long *a = malloc(sizeof(long long)*N);
[L28]              i=0
       VAL         [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L28]  COND TRUE   i<N
[L30]              a[i]=((i+1)*(i+1))
       VAL         [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L28]              i++
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L28]  COND FALSE  !(i<N)
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L33]              i=0
       VAL         [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L33]  COND TRUE   i<N
[L35]  EXPR        a[i]
[L35]              a[i]=a[i]-(i*i)
[L33]              i++
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L33]  COND FALSE  !(i<N)
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L38]              i=0
       VAL         [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L38]  COND TRUE   i<N
[L40]  EXPR        a[i]
[L40]              a[i]=a[i]-i
[L38]              i++
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L38]  COND FALSE  !(i<N)
       VAL         [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L43]              i=0
       VAL         [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L43]  COND TRUE   i<N
[L45]  EXPR        a[i]
       VAL         [\old(N)=0, a={-1:0}, a[i]=1, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1]
[L45]  CALL        __VERIFIER_assert(a[i]==i)
       VAL         [\old(cond)=0, \old(N)=0, N=1]
[L13]  COND TRUE   !(cond)
       VAL         [\old(cond)=0, \old(N)=0, cond=0, N=1]
[L13]              __VERIFIER_error()
       VAL         [\old(cond)=0, \old(N)=0, cond=0, N=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 60 SDtfs, 52 SDslu, 11 SDs, 0 SdLazy, 90 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 1840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...