java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:46:55,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:46:55,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:46:56,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:46:56,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:46:56,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:46:56,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:46:56,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:46:56,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:46:56,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:46:56,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:46:56,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:46:56,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:46:56,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:46:56,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:46:56,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:46:56,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:46:56,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:46:56,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:46:56,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:46:56,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:46:56,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:46:56,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:46:56,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:46:56,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:46:56,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:46:56,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:46:56,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:46:56,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:46:56,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:46:56,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:46:56,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:46:56,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:46:56,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:46:56,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:46:56,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:46:56,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:46:56,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:46:56,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:46:56,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:46:56,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:46:56,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:46:56,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:46:56,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:46:56,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:46:56,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:46:56,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:46:56,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:46:56,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:46:56,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:46:56,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:46:56,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:46:56,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:46:56,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:46:56,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:46:56,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:46:56,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:46:56,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:46:56,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:46:56,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:46:56,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:46:56,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:46:56,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:46:56,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:46:56,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:46:56,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:46:56,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:46:56,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:46:56,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:46:56,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:46:56,418 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:46:56,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2019-10-07 13:46:56,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0fccdf7/431bf6f35ab44e47bed485c183db1e80/FLAG6dabea7bf [2019-10-07 13:46:56,890 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:46:56,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-10-07 13:46:56,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0fccdf7/431bf6f35ab44e47bed485c183db1e80/FLAG6dabea7bf [2019-10-07 13:46:57,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0fccdf7/431bf6f35ab44e47bed485c183db1e80 [2019-10-07 13:46:57,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:46:57,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:46:57,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:46:57,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:46:57,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:46:57,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af509e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57, skipping insertion in model container [2019-10-07 13:46:57,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,345 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:46:57,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:46:57,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:46:57,598 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:46:57,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:46:57,630 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:46:57,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57 WrapperNode [2019-10-07 13:46:57,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:46:57,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:46:57,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:46:57,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:46:57,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (1/1) ... [2019-10-07 13:46:57,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:46:57,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:46:57,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:46:57,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:46:57,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (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 [2019-10-07 13:46:57,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:46:57,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:46:57,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:46:57,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:46:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:46:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:46:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:46:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:46:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:46:57,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:46:57,980 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:46:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:46:57 BoogieIcfgContainer [2019-10-07 13:46:57,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:46:57,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:46:57,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:46:57,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:46:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:46:57" (1/3) ... [2019-10-07 13:46:57,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a50c5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:46:57, skipping insertion in model container [2019-10-07 13:46:57,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:46:57" (2/3) ... [2019-10-07 13:46:57,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a50c5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:46:57, skipping insertion in model container [2019-10-07 13:46:57,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:46:57" (3/3) ... [2019-10-07 13:46:57,990 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-10-07 13:46:58,006 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:46:58,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:46:58,059 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:46:58,085 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:46:58,085 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:46:58,085 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:46:58,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:46:58,086 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:46:58,086 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:46:58,086 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:46:58,086 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:46:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:46:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:46:58,121 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:58,122 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:58,127 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 9943896, now seen corresponding path program 1 times [2019-10-07 13:46:58,142 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:58,142 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:58,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:58,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:58,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:58,274 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:58,275 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:46:58,275 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:46:58,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:46:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:46:58,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:46:58,297 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:46:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:58,323 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:46:58,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:46:58,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:46:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:58,331 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:46:58,332 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:46:58,335 INFO L606 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 [2019-10-07 13:46:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:46:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:46:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:46:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:46:58,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:46:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:58,365 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:46:58,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:46:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:46:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:46:58,365 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:58,366 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:58,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash 282846133, now seen corresponding path program 1 times [2019-10-07 13:46:58,367 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:58,367 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:58,367 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:58,367 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:58,408 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:58,408 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:58,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:46:58,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:58,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:58,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:58,526 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:46:58,527 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:58,533 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:58,541 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:58,542 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:58,608 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:46:58,876 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:46:58,907 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:46:58,910 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:58,911 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:58,911 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:46:58,911 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:46:58,912 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#true [2019-10-07 13:46:58,912 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:58,913 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:58,913 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 100#true [2019-10-07 13:46:58,914 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:58,914 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:46:58,914 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:46:58,915 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 76#(and (<= 1 main_~i~0) (not (<= main_~i~0 8)) (<= 8 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:46:58,915 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (<= 1 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:46:59,089 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:46:59,089 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 6] total 11 [2019-10-07 13:46:59,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:46:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:46:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:46:59,094 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-10-07 13:46:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:46:59,221 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-07 13:46:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:46:59,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-10-07 13:46:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:46:59,224 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:46:59,224 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 13:46:59,227 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:46:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 13:46:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 13:46:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:46:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-07 13:46:59,237 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-07 13:46:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:46:59,237 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-07 13:46:59,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:46:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-07 13:46:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:46:59,241 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:46:59,242 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:46:59,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:59,446 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:46:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:46:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 76376728, now seen corresponding path program 2 times [2019-10-07 13:46:59,447 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:46:59,447 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:59,447 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:59,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:46:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:46:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:46:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:59,528 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:46:59,528 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:46:59,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:46:59,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:46:59,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:46:59,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:46:59,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:46:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:59,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:46:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:46:59,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:46:59,657 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:46:59,657 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:46:59,658 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:46:59,658 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:46:59,658 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:46:59,670 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:46:59,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:46:59,769 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:46:59,772 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:46:59,772 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:46:59,772 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:46:59,773 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:46:59,773 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#true [2019-10-07 13:46:59,773 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:59,773 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:46:59,774 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 100#true [2019-10-07 13:46:59,774 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:46:59,774 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 13:46:59,775 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:46:59,775 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 76#(and (<= 1 main_~i~0) (not (<= main_~i~0 8)) (<= 8 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:46:59,775 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (<= 1 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:46:59,917 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:46:59,918 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 6] total 15 [2019-10-07 13:46:59,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 13:46:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 13:46:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:46:59,920 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-10-07 13:47:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:00,085 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-10-07 13:47:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:47:00,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-10-07 13:47:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:00,088 INFO L225 Difference]: With dead ends: 24 [2019-10-07 13:47:00,088 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 13:47:00,090 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:47:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 13:47:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 13:47:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 13:47:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-10-07 13:47:00,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2019-10-07 13:47:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:00,098 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-10-07 13:47:00,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 13:47:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-10-07 13:47:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:47:00,099 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:00,099 INFO L385 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:00,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:00,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1416005160, now seen corresponding path program 3 times [2019-10-07 13:47:00,302 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:00,303 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:00,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:00,303 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:47:00,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:00,487 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:00,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:00,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:47:00,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:47:00,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:47:00,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:47:00,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:47:00,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:47:00,845 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:47:00,845 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:47:00,846 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:47:00,846 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:47:00,846 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:47:00,867 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:47:00,921 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:47:00,943 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:47:00,945 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:47:00,945 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:47:00,946 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:47:00,946 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:47:00,946 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#true [2019-10-07 13:47:00,947 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:47:00,947 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:47:00,947 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 100#true [2019-10-07 13:47:00,948 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:47:00,948 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:47:00,948 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:47:00,948 INFO L193 IcfgInterpreter]: Reachable states at location L13-4 satisfy 76#(and (<= 1 main_~i~0) (not (<= main_~i~0 8)) (<= 8 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:47:00,949 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (<= 1 main_~i~0) (<= 0 main_~sn~0)) [2019-10-07 13:47:01,159 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:47:01,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 6] total 29 [2019-10-07 13:47:01,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 13:47:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 13:47:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:47:01,162 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 29 states. [2019-10-07 13:47:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:01,625 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-10-07 13:47:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:47:01,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 18 [2019-10-07 13:47:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:01,628 INFO L225 Difference]: With dead ends: 25 [2019-10-07 13:47:01,628 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 13:47:01,630 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 13:47:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 13:47:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 13:47:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 13:47:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-10-07 13:47:01,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-10-07 13:47:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:01,638 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-10-07 13:47:01,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 13:47:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-10-07 13:47:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:47:01,639 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:01,639 INFO L385 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:01,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:01,853 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash -971901643, now seen corresponding path program 4 times [2019-10-07 13:47:01,853 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:01,853 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:01,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:01,854 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:47:01,947 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:01,947 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:01,947 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:47:01,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:47:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:47:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:47:01,948 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-10-07 13:47:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:01,967 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-10-07 13:47:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:47:01,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-07 13:47:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:01,968 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:47:01,968 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:47:01,969 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:47:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:47:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:47:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:47:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:47:01,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-07 13:47:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:01,970 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:47:01,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:47:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:47:01,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:47:01,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:47:02,161 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-07 13:47:02,163 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:47:02,163 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:47:02,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:47:02,164 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:47:02,164 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:47:02,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:47:02,164 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2019-10-07 13:47:02,164 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2019-10-07 13:47:02,165 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2019-10-07 13:47:02,166 INFO L439 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 10 main_~sn~0) (< main_~i~0 7) (<= 6 main_~i~0) (<= main_~sn~0 10)) (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 7 main_~i~0) (< main_~i~0 8) (<= 12 main_~sn~0) (<= main_~sn~0 12)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))) [2019-10-07 13:47:02,167 INFO L439 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (< 8 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) [2019-10-07 13:47:02,167 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:47:02,167 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:47:02,167 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:47:02,167 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:47:02,168 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:47:02,168 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:47:02,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:47:02 BoogieIcfgContainer [2019-10-07 13:47:02,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:47:02,211 INFO L168 Benchmark]: Toolchain (without parser) took 4882.64 ms. Allocated memory was 147.3 MB in the beginning and 243.3 MB in the end (delta: 95.9 MB). Free memory was 103.8 MB in the beginning and 129.0 MB in the end (delta: -25.2 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,211 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.16 ms. Allocated memory is still 147.3 MB. Free memory was 103.6 MB in the beginning and 94.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,216 INFO L168 Benchmark]: Boogie Preprocessor took 105.79 ms. Allocated memory was 147.3 MB in the beginning and 202.9 MB in the end (delta: 55.6 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,218 INFO L168 Benchmark]: RCFGBuilder took 244.00 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 169.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,220 INFO L168 Benchmark]: TraceAbstraction took 4226.26 ms. Allocated memory was 202.9 MB in the beginning and 243.3 MB in the end (delta: 40.4 MB). Free memory was 169.9 MB in the beginning and 129.0 MB in the end (delta: 40.9 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:47:02,232 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.16 ms. Allocated memory is still 147.3 MB. Free memory was 103.6 MB in the beginning and 94.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.79 ms. Allocated memory was 147.3 MB in the beginning and 202.9 MB in the end (delta: 55.6 MB). Free memory was 94.5 MB in the beginning and 181.7 MB in the end (delta: -87.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 244.00 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 169.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4226.26 ms. Allocated memory was 202.9 MB in the beginning and 243.3 MB in the end (delta: 40.4 MB). Free memory was 169.9 MB in the beginning and 129.0 MB in the end (delta: 40.9 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 13]: Loop Invariant Derived loop invariant: ((((((((((10 <= sn && i < 7) && 6 <= i) && sn <= 10) || (((1 <= i && i <= 1) && sn <= 0) && 0 <= sn)) || (((7 <= i && i < 8) && 12 <= sn) && sn <= 12)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 9, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 42 SDtfs, 20 SDslu, 200 SDs, 0 SdLazy, 346 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 21 NumberOfFragments, 130 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 6535 SizeOfPredicates, 4 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 45/186 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 615, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 63, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 30, TOOLS_POST_TIME[ms]: 29, TOOLS_POST_CALL_APPLICATIONS: 15, TOOLS_POST_CALL_TIME[ms]: 28, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME[ms]: 40, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 9, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 72, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 54, DOMAIN_JOIN_TIME[ms]: 298, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME[ms]: 124, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME[ms]: 28, DOMAIN_ISBOTTOM_APPLICATIONS: 3, DOMAIN_ISBOTTOM_TIME[ms]: 3, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 315, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 314, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME[ms]: 19, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 19, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 23, DAG_COMPRESSION_PROCESSED_NODES: 171, DAG_COMPRESSION_RETAINED_NODES: 123, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...