java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:19:14,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:19:14,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:19:14,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:19:14,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:19:14,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:19:14,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:19:14,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:19:14,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:19:14,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:19:14,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:19:14,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:19:14,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:19:14,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:19:14,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:19:14,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:19:14,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:19:14,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:19:14,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:19:14,198 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:19:14,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:19:14,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:19:14,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:19:14,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:19:14,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:19:14,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:19:14,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:19:14,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:19:14,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:19:14,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:19:14,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:19:14,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:19:14,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:19:14,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:19:14,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:19:14,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:19:14,221 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:19:14,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:19:14,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:19:14,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:19:14,247 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:19:14,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:19:14,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:19:14,248 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:19:14,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:19:14,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:19:14,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:19:14,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:19:14,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:19:14,251 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:19:14,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:19:14,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:19:14,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:19:14,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:19:14,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:19:14,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:19:14,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:19:14,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:19:14,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:19:14,255 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:19:14,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:19:14,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:19:14,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:19:14,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:19:14,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:19:14,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:19:14,341 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:19:14,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:19:14,342 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-14 19:19:14,408 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d510c3da/0f5e79075b994f568334fdd6a741421d/FLAG3e1662bbd [2018-11-14 19:19:14,868 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:19:14,868 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call1_true-termination.i [2018-11-14 19:19:14,874 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d510c3da/0f5e79075b994f568334fdd6a741421d/FLAG3e1662bbd [2018-11-14 19:19:14,890 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d510c3da/0f5e79075b994f568334fdd6a741421d [2018-11-14 19:19:14,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:19:14,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:19:14,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:19:14,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:19:14,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:19:14,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:19:14" (1/1) ... [2018-11-14 19:19:14,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c7a8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:14, skipping insertion in model container [2018-11-14 19:19:14,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:19:14" (1/1) ... [2018-11-14 19:19:14,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:19:14,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:19:15,194 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:19:15,198 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:19:15,220 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:19:15,241 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:19:15,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15 WrapperNode [2018-11-14 19:19:15,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:19:15,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:19:15,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:19:15,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:19:15,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... [2018-11-14 19:19:15,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:19:15,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:19:15,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:19:15,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:19:15,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:19:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:19:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:19:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:19:15,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:19:15,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:19:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:19:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:19:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:19:15,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:19:15,869 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:19:15,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:19:15 BoogieIcfgContainer [2018-11-14 19:19:15,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:19:15,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:19:15,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:19:15,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:19:15,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:19:14" (1/3) ... [2018-11-14 19:19:15,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760569a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:19:15, skipping insertion in model container [2018-11-14 19:19:15,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:19:15" (2/3) ... [2018-11-14 19:19:15,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760569a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:19:15, skipping insertion in model container [2018-11-14 19:19:15,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:19:15" (3/3) ... [2018-11-14 19:19:15,877 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call1_true-termination.i [2018-11-14 19:19:15,887 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:19:15,893 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:19:15,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:19:15,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:19:15,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:19:15,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:19:15,943 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:19:15,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:19:15,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:19:15,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:19:15,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:19:15,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:19:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 19:19:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:19:15,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:15,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:15,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:15,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -173834890, now seen corresponding path program 1 times [2018-11-14 19:19:15,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:15,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:16,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:16,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:19:16,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:16,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 19:19:16,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25#true} is VALID [2018-11-14 19:19:16,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 19:19:16,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #36#return; {25#true} is VALID [2018-11-14 19:19:16,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret2 := main(); {25#true} is VALID [2018-11-14 19:19:16,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {25#true} is VALID [2018-11-14 19:19:16,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 19:19:16,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {26#false} is VALID [2018-11-14 19:19:16,114 INFO L256 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {26#false} is VALID [2018-11-14 19:19:16,114 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 19:19:16,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume ~cond == 0; {26#false} is VALID [2018-11-14 19:19:16,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 19:19:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:19:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:19:16,126 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 19:19:16,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:16,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:19:16,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:19:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:19:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:19:16,219 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 19:19:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:16,303 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-14 19:19:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:19:16,303 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 19:19:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:19:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 19:19:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:19:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2018-11-14 19:19:16,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2018-11-14 19:19:16,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:16,657 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:19:16,657 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 19:19:16,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:19:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 19:19:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 19:19:16,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:16,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 19:19:16,780 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:19:16,780 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:19:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:16,784 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 19:19:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:19:16,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:16,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:16,785 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:19:16,785 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:19:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:16,789 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 19:19:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:19:16,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:16,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:16,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:16,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:19:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 19:19:16,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 19:19:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:16,794 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 19:19:16,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:19:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 19:19:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:19:16,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:16,796 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:16,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash -737648989, now seen corresponding path program 1 times [2018-11-14 19:19:16,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:16,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:19:16,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:16,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {125#true} is VALID [2018-11-14 19:19:16,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {125#true} is VALID [2018-11-14 19:19:16,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2018-11-14 19:19:16,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #36#return; {125#true} is VALID [2018-11-14 19:19:16,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret2 := main(); {125#true} is VALID [2018-11-14 19:19:16,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {125#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {127#(= main_~i~0 0)} is VALID [2018-11-14 19:19:16,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(= main_~i~0 0)} assume true; {127#(= main_~i~0 0)} is VALID [2018-11-14 19:19:16,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {127#(= main_~i~0 0)} assume !(~i~0 < 1024); {126#false} is VALID [2018-11-14 19:19:16,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {126#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {126#false} is VALID [2018-11-14 19:19:16,987 INFO L256 TraceCheckUtils]: 9: Hoare triple {126#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {126#false} is VALID [2018-11-14 19:19:16,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {126#false} ~cond := #in~cond; {126#false} is VALID [2018-11-14 19:19:16,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {126#false} assume ~cond == 0; {126#false} is VALID [2018-11-14 19:19:16,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {126#false} assume !false; {126#false} is VALID [2018-11-14 19:19:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:19:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:19:16,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:19:16,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:16,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:19:17,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:17,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:19:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:19:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:19:17,050 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-14 19:19:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:17,156 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:19:17,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:19:17,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 19:19:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:19:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 19:19:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:19:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-14 19:19:17,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2018-11-14 19:19:17,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:17,334 INFO L225 Difference]: With dead ends: 24 [2018-11-14 19:19:17,334 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:19:17,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:19:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:19:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 19:19:17,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:17,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 19:19:17,347 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 19:19:17,347 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 19:19:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:17,349 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:19:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:19:17,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:17,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:17,350 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 19:19:17,350 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 19:19:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:17,352 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:19:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:19:17,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:17,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:17,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:17,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:19:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 19:19:17,355 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-14 19:19:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:17,356 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 19:19:17,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:19:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 19:19:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:19:17,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:17,357 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:17,358 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:17,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1154592614, now seen corresponding path program 1 times [2018-11-14 19:19:17,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:17,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:17,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:19:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:17,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-14 19:19:17,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-14 19:19:17,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-14 19:19:17,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #36#return; {225#true} is VALID [2018-11-14 19:19:17,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2018-11-14 19:19:17,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {227#(= main_~i~0 0)} is VALID [2018-11-14 19:19:17,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {227#(= main_~i~0 0)} assume true; {227#(= main_~i~0 0)} is VALID [2018-11-14 19:19:17,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {227#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {227#(= main_~i~0 0)} is VALID [2018-11-14 19:19:17,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {227#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {228#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:17,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(<= main_~i~0 1)} assume true; {228#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:17,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 1024); {226#false} is VALID [2018-11-14 19:19:17,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {226#false} is VALID [2018-11-14 19:19:17,476 INFO L256 TraceCheckUtils]: 12: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {226#false} is VALID [2018-11-14 19:19:17,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-14 19:19:17,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} assume ~cond == 0; {226#false} is VALID [2018-11-14 19:19:17,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-14 19:19:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:17,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:17,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:17,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:19:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:17,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:17,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-14 19:19:17,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-14 19:19:17,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-14 19:19:17,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #36#return; {225#true} is VALID [2018-11-14 19:19:17,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2018-11-14 19:19:17,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {247#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:17,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {247#(<= main_~i~0 0)} assume true; {247#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:17,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {247#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {247#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:17,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {247#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {228#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:17,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {228#(<= main_~i~0 1)} assume true; {228#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:17,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 1024); {226#false} is VALID [2018-11-14 19:19:17,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {226#false} is VALID [2018-11-14 19:19:17,679 INFO L256 TraceCheckUtils]: 12: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {226#false} is VALID [2018-11-14 19:19:17,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-14 19:19:17,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} assume ~cond == 0; {226#false} is VALID [2018-11-14 19:19:17,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-14 19:19:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:19:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:19:17,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 19:19:17,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:17,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:19:17,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:17,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:19:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:19:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:19:17,934 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-14 19:19:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:18,187 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 19:19:18,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:19:18,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 19:19:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:19:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-14 19:19:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:19:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-14 19:19:18,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-14 19:19:18,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:18,308 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:19:18,308 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 19:19:18,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:19:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 19:19:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-14 19:19:18,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:18,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-14 19:19:18,341 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-14 19:19:18,341 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-14 19:19:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:18,343 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:19:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:19:18,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:18,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:18,344 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-14 19:19:18,344 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-14 19:19:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:18,346 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:19:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 19:19:18,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:18,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:18,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:18,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:19:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 19:19:18,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-11-14 19:19:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:18,350 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 19:19:18,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:19:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:19:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:19:18,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:18,351 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:18,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1276704957, now seen corresponding path program 2 times [2018-11-14 19:19:18,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:19:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:18,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-14 19:19:18,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {386#true} is VALID [2018-11-14 19:19:18,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 19:19:18,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #36#return; {386#true} is VALID [2018-11-14 19:19:18,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret2 := main(); {386#true} is VALID [2018-11-14 19:19:18,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {388#(= main_~i~0 0)} is VALID [2018-11-14 19:19:18,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {388#(= main_~i~0 0)} assume true; {388#(= main_~i~0 0)} is VALID [2018-11-14 19:19:18,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {388#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {388#(= main_~i~0 0)} is VALID [2018-11-14 19:19:18,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 1)} assume true; {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {390#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:18,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {390#(<= main_~i~0 2)} assume true; {390#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:18,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(<= main_~i~0 2)} assume !(~i~0 < 1024); {387#false} is VALID [2018-11-14 19:19:18,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {387#false} is VALID [2018-11-14 19:19:18,494 INFO L256 TraceCheckUtils]: 15: Hoare triple {387#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {387#false} is VALID [2018-11-14 19:19:18,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {387#false} ~cond := #in~cond; {387#false} is VALID [2018-11-14 19:19:18,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {387#false} assume ~cond == 0; {387#false} is VALID [2018-11-14 19:19:18,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-14 19:19:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:18,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:18,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:18,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:19:18,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:19:18,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:18,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:18,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-14 19:19:18,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {386#true} is VALID [2018-11-14 19:19:18,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-14 19:19:18,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #36#return; {386#true} is VALID [2018-11-14 19:19:18,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret2 := main(); {386#true} is VALID [2018-11-14 19:19:18,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {409#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:18,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(<= main_~i~0 0)} assume true; {409#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:18,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {409#(<= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {409#(<= main_~i~0 0)} is VALID [2018-11-14 19:19:18,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {409#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 1)} assume true; {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {389#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:18,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {390#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:18,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {390#(<= main_~i~0 2)} assume true; {390#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:18,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(<= main_~i~0 2)} assume !(~i~0 < 1024); {387#false} is VALID [2018-11-14 19:19:18,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {387#false} is VALID [2018-11-14 19:19:18,684 INFO L256 TraceCheckUtils]: 15: Hoare triple {387#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {387#false} is VALID [2018-11-14 19:19:18,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {387#false} ~cond := #in~cond; {387#false} is VALID [2018-11-14 19:19:18,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {387#false} assume ~cond == 0; {387#false} is VALID [2018-11-14 19:19:18,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-14 19:19:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:18,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:19:18,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 19:19:18,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:19:18,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:18,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:19:18,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:18,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:19:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:19:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:19:18,770 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states. [2018-11-14 19:19:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:18,901 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 19:19:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:19:18,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:19:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:19:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 19:19:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:19:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 19:19:18,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2018-11-14 19:19:19,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:19,025 INFO L225 Difference]: With dead ends: 30 [2018-11-14 19:19:19,025 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 19:19:19,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:19:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 19:19:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-14 19:19:19,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:19,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-14 19:19:19,083 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-14 19:19:19,083 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-14 19:19:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:19,086 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:19:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:19:19,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:19,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:19,092 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-14 19:19:19,092 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-14 19:19:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:19,095 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:19:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:19:19,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:19,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:19,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:19,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 19:19:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-14 19:19:19,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-11-14 19:19:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:19,103 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-14 19:19:19,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:19:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-14 19:19:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:19:19,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:19,104 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:19,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:19,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1288215558, now seen corresponding path program 3 times [2018-11-14 19:19:19,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:19,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:19:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:19,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-14 19:19:19,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {571#true} is VALID [2018-11-14 19:19:19,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 19:19:19,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #36#return; {571#true} is VALID [2018-11-14 19:19:19,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret2 := main(); {571#true} is VALID [2018-11-14 19:19:19,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {571#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {573#(= main_~i~0 0)} is VALID [2018-11-14 19:19:19,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#(= main_~i~0 0)} assume true; {573#(= main_~i~0 0)} is VALID [2018-11-14 19:19:19,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {573#(= main_~i~0 0)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {573#(= main_~i~0 0)} is VALID [2018-11-14 19:19:19,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {574#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:19,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(<= main_~i~0 1)} assume true; {574#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:19,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(<= main_~i~0 1)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {574#(<= main_~i~0 1)} is VALID [2018-11-14 19:19:19,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {574#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {575#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:19,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {575#(<= main_~i~0 2)} assume true; {575#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:19,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {575#(<= main_~i~0 2)} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {575#(<= main_~i~0 2)} is VALID [2018-11-14 19:19:19,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {575#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {576#(<= main_~i~0 3)} is VALID [2018-11-14 19:19:19,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {576#(<= main_~i~0 3)} assume true; {576#(<= main_~i~0 3)} is VALID [2018-11-14 19:19:19,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#(<= main_~i~0 3)} assume !(~i~0 < 1024); {572#false} is VALID [2018-11-14 19:19:19,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {572#false} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {572#false} is VALID [2018-11-14 19:19:19,323 INFO L256 TraceCheckUtils]: 18: Hoare triple {572#false} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {572#false} is VALID [2018-11-14 19:19:19,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2018-11-14 19:19:19,323 INFO L273 TraceCheckUtils]: 20: Hoare triple {572#false} assume ~cond == 0; {572#false} is VALID [2018-11-14 19:19:19,323 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-14 19:19:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:19,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:19,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:19:19,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:19:19,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:19,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:19,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 19:19:19,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 19:19:19,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-14 19:19:19,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 19:19:19,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:19:19,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 19:19:19,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:19:19,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2018-11-14 19:19:19,694 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:19:19,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2018-11-14 19:19:19,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {571#true} is VALID [2018-11-14 19:19:19,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 19:19:19,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #36#return; {571#true} is VALID [2018-11-14 19:19:19,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret2 := main(); {571#true} is VALID [2018-11-14 19:19:19,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {571#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);havoc ~i~0;~i~0 := 0; {571#true} is VALID [2018-11-14 19:19:19,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 19:19:19,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {571#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {571#true} is VALID [2018-11-14 19:19:19,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {571#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {571#true} is VALID [2018-11-14 19:19:19,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 19:19:19,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {571#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {571#true} is VALID [2018-11-14 19:19:19,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {571#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {571#true} is VALID [2018-11-14 19:19:19,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#true} assume true; {571#true} is VALID [2018-11-14 19:19:19,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#true} assume !!(~i~0 < 1024);call write~int(~i~0, ~#A~0.base, ~#A~0.offset + ~i~0 * 4, 4); {619#(and (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))) (< main_~i~0 1024))} is VALID [2018-11-14 19:19:19,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {619#(and (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) |main_~#A~0.offset|))) (< main_~i~0 1024))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {623#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} is VALID [2018-11-14 19:19:19,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {623#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} assume true; {623#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} is VALID [2018-11-14 19:19:19,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {623#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|)))))} assume !(~i~0 < 1024); {630#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} is VALID [2018-11-14 19:19:19,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#(exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10)))} call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4092, 4); {634#(and (<= 1023 |main_#t~mem1|) (< |main_#t~mem1| 1024))} is VALID [2018-11-14 19:19:19,798 INFO L256 TraceCheckUtils]: 18: Hoare triple {634#(and (<= 1023 |main_#t~mem1|) (< |main_#t~mem1| 1024))} call __VERIFIER_assert((if #t~mem1 == 1023 then 1 else 0)); {638#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:19:19,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {638#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {642#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:19:19,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {642#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {572#false} is VALID [2018-11-14 19:19:19,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#false} assume !false; {572#false} is VALID [2018-11-14 19:19:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 19:19:19,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:19:19,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-14 19:19:19,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-14 19:19:19,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:19,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 19:19:19,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:19,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 19:19:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 19:19:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:19:19,880 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-11-14 19:19:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:24,618 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 19:19:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 19:19:24,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-14 19:19:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:19:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-11-14 19:19:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:19:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-11-14 19:19:24,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 32 transitions. [2018-11-14 19:19:24,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:24,682 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:19:24,682 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:19:24,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-11-14 19:19:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:19:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:19:24,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:24,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:19:24,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:19:24,685 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:19:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:24,686 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:19:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:19:24,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:24,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:24,686 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:19:24,686 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:19:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:24,687 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:19:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:19:24,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:24,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:24,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:24,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:19:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:19:24,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-14 19:19:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:24,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:19:24,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 19:19:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:19:24,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:24,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:19:24,785 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:19:24,785 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:19:24,785 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:19:24,785 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:19:24,785 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:19:24,785 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:19:24,786 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:19:24,786 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 15) the Hoare annotation is: true [2018-11-14 19:19:24,786 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 15) no Hoare annotation was computed. [2018-11-14 19:19:24,786 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (<= 1023 |main_#t~mem1|) (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))) (<= 1023 v_main_~i~0_10))) (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))))) (< |main_#t~mem1| 1024)) [2018-11-14 19:19:24,786 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-14 19:19:24,786 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 15) no Hoare annotation was computed. [2018-11-14 19:19:24,787 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-14 19:19:24,787 INFO L425 ceAbstractionStarter]: For program point L11-3(lines 11 13) no Hoare annotation was computed. [2018-11-14 19:19:24,787 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (or (exists ((v_main_~i~0_10 Int)) (and (< v_main_~i~0_10 1024) (<= main_~i~0 (+ v_main_~i~0_10 1)) (= v_main_~i~0_10 (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 v_main_~i~0_10) |main_~#A~0.offset|))))) (= main_~i~0 0)) [2018-11-14 19:19:24,787 INFO L425 ceAbstractionStarter]: For program point L11-5(lines 11 13) no Hoare annotation was computed. [2018-11-14 19:19:24,787 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:19:24,787 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 19:19:24,788 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:19:24,788 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 19:19:24,788 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 19:19:24,788 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 19:19:24,790 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:19:24,793 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 19:19:24,794 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:19:24,795 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:19:24,795 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:19:24,795 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:19:24,795 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:19:24,795 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:19:24,800 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 19:19:24,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,806 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 19:19:24,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:19:24 BoogieIcfgContainer [2018-11-14 19:19:24,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:19:24,809 INFO L168 Benchmark]: Toolchain (without parser) took 9909.93 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -432.6 MB). Peak memory consumption was 314.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:24,811 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:19:24,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.92 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:24,813 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:19:24,813 INFO L168 Benchmark]: RCFGBuilder took 587.45 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:24,814 INFO L168 Benchmark]: TraceAbstraction took 8937.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 344.0 MB). Peak memory consumption was 344.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:24,818 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.92 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 587.45 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8937.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 344.0 MB). Peak memory consumption was 344.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2018-11-14 19:19:24,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,827 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,827 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 19:19:24,828 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,828 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,828 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,828 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_10,QUANTIFIED] [2018-11-14 19:19:24,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists v_main_~i~0_10 : int :: (v_main_~i~0_10 < 1024 && i <= v_main_~i~0_10 + 1) && v_main_~i~0_10 == unknown-#memory_int-unknown[A][4 * v_main_~i~0_10 + A]) || i == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 11 SDslu, 124 SDs, 0 SdLazy, 74 SolverSat, 12 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 77 HoareAnnotationTreeSize, 12 FomulaSimplifications, 75 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 139 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 3 QuantifiedInterpolants, 5353 SizeOfPredicates, 8 NumberOfNonLiveVariables, 167 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 15/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...