java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 16:07:13,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 16:07:13,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 16:07:13,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 16:07:13,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 16:07:13,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 16:07:13,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 16:07:13,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 16:07:13,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 16:07:13,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 16:07:13,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 16:07:13,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 16:07:13,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 16:07:13,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 16:07:13,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 16:07:13,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 16:07:13,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 16:07:13,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 16:07:13,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 16:07:13,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 16:07:13,207 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 16:07:13,209 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 16:07:13,212 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 16:07:13,212 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 16:07:13,212 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 16:07:13,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 16:07:13,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 16:07:13,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 16:07:13,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 16:07:13,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 16:07:13,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 16:07:13,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 16:07:13,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 16:07:13,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 16:07:13,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 16:07:13,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 16:07:13,224 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-22 16:07:13,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 16:07:13,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 16:07:13,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 16:07:13,245 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 16:07:13,246 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 16:07:13,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 16:07:13,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 16:07:13,246 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 16:07:13,246 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-22 16:07:13,247 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 16:07:13,247 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 16:07:13,247 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 16:07:13,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 16:07:13,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 16:07:13,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 16:07:13,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 16:07:13,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 16:07:13,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 16:07:13,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 16:07:13,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 16:07:13,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 16:07:13,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 16:07:13,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 16:07:13,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 16:07:13,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 16:07:13,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 16:07:13,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 16:07:13,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 16:07:13,251 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 16:07:13,251 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 16:07:13,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 16:07:13,251 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 16:07:13,252 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 16:07:13,252 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-22 16:07:13,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 16:07:13,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 16:07:13,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 16:07:13,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 16:07:13,319 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 16:07:13,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 16:07:13,376 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7afe03720/2c2e13d4f4964983a3492fe9910df3b2/FLAG54126ca61 [2018-10-22 16:07:13,829 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 16:07:13,830 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 16:07:13,838 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7afe03720/2c2e13d4f4964983a3492fe9910df3b2/FLAG54126ca61 [2018-10-22 16:07:13,852 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7afe03720/2c2e13d4f4964983a3492fe9910df3b2 [2018-10-22 16:07:13,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 16:07:13,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 16:07:13,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 16:07:13,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 16:07:13,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 16:07:13,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:07:13" (1/1) ... [2018-10-22 16:07:13,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b98b391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:13, skipping insertion in model container [2018-10-22 16:07:13,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:07:13" (1/1) ... [2018-10-22 16:07:13,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 16:07:13,908 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 16:07:14,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:07:14,124 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 16:07:14,150 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:07:14,167 INFO L193 MainTranslator]: Completed translation [2018-10-22 16:07:14,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14 WrapperNode [2018-10-22 16:07:14,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 16:07:14,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 16:07:14,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 16:07:14,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 16:07:14,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 16:07:14,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 16:07:14,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 16:07:14,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 16:07:14,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... [2018-10-22 16:07:14,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 16:07:14,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 16:07:14,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 16:07:14,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 16:07:14,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 16:07:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 16:07:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 16:07:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 16:07:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 16:07:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 16:07:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 16:07:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 16:07:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 16:07:14,789 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 16:07:14,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:07:14 BoogieIcfgContainer [2018-10-22 16:07:14,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 16:07:14,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 16:07:14,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 16:07:14,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 16:07:14,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 04:07:13" (1/3) ... [2018-10-22 16:07:14,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29b1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:07:14, skipping insertion in model container [2018-10-22 16:07:14,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:07:14" (2/3) ... [2018-10-22 16:07:14,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d29b1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:07:14, skipping insertion in model container [2018-10-22 16:07:14,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:07:14" (3/3) ... [2018-10-22 16:07:14,799 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-10-22 16:07:14,809 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 16:07:14,820 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 16:07:14,838 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 16:07:14,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 16:07:14,881 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 16:07:14,881 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 16:07:14,882 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 16:07:14,882 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 16:07:14,882 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 16:07:14,882 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 16:07:14,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 16:07:14,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 16:07:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-22 16:07:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-22 16:07:14,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:14,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:14,917 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:14,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-10-22 16:07:14,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:14,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:14,974 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:07:15,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:07:15,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 16:07:15,039 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:15,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 16:07:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 16:07:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 16:07:15,063 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-22 16:07:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:15,104 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-10-22 16:07:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 16:07:15,105 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-22 16:07:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:15,118 INFO L225 Difference]: With dead ends: 63 [2018-10-22 16:07:15,118 INFO L226 Difference]: Without dead ends: 30 [2018-10-22 16:07:15,123 INFO L605 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-10-22 16:07:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-22 16:07:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-22 16:07:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-22 16:07:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-10-22 16:07:15,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-10-22 16:07:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:15,172 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-10-22 16:07:15,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 16:07:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-10-22 16:07:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-22 16:07:15,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:15,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:15,174 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:15,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-10-22 16:07:15,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:15,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:15,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:15,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:15,177 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:07:15,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:07:15,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 16:07:15,285 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:15,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 16:07:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 16:07:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 16:07:15,288 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-10-22 16:07:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:15,500 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-10-22 16:07:15,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 16:07:15,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-22 16:07:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:15,502 INFO L225 Difference]: With dead ends: 36 [2018-10-22 16:07:15,503 INFO L226 Difference]: Without dead ends: 34 [2018-10-22 16:07:15,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:07:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-22 16:07:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-22 16:07:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-22 16:07:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-10-22 16:07:15,515 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-10-22 16:07:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:15,516 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-10-22 16:07:15,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 16:07:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-10-22 16:07:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-22 16:07:15,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:15,518 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:15,518 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:15,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-10-22 16:07:15,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:15,520 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:07:15,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:15,886 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:15,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-22 16:07:15,889 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84] [2018-10-22 16:07:15,939 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:15,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:16,110 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:16,112 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-10-22 16:07:16,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:16,124 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:16,274 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64% of their original sizes. [2018-10-22 16:07:16,274 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:16,586 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:16,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-10-22 16:07:16,588 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:16,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 16:07:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 16:07:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-22 16:07:16,589 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 10 states. [2018-10-22 16:07:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:17,689 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-10-22 16:07:17,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 16:07:17,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-22 16:07:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:17,691 INFO L225 Difference]: With dead ends: 54 [2018-10-22 16:07:17,691 INFO L226 Difference]: Without dead ends: 52 [2018-10-22 16:07:17,692 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:07:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-22 16:07:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-10-22 16:07:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-22 16:07:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-10-22 16:07:17,709 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 21 [2018-10-22 16:07:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:17,711 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-10-22 16:07:17,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 16:07:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-10-22 16:07:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-22 16:07:17,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:17,714 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:17,715 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:17,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-10-22 16:07:17,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:17,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:17,717 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-22 16:07:18,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:18,159 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:18,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-22 16:07:18,159 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78] [2018-10-22 16:07:18,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:18,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:18,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:18,205 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 16:07:18,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:18,211 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:18,267 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 57.45% of their original sizes. [2018-10-22 16:07:18,268 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:18,997 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:18,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:18,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-10-22 16:07:18,998 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:18,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 16:07:18,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 16:07:19,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:07:19,000 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 14 states. [2018-10-22 16:07:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:20,744 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-10-22 16:07:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 16:07:20,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-10-22 16:07:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:20,747 INFO L225 Difference]: With dead ends: 76 [2018-10-22 16:07:20,747 INFO L226 Difference]: Without dead ends: 74 [2018-10-22 16:07:20,748 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-10-22 16:07:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-22 16:07:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-10-22 16:07:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-22 16:07:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-10-22 16:07:20,774 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2018-10-22 16:07:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:20,774 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-10-22 16:07:20,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 16:07:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-10-22 16:07:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-22 16:07:20,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:20,779 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:20,779 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:20,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-10-22 16:07:20,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:20,784 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-22 16:07:20,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:20,936 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:20,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-22 16:07:20,936 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [52], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [85], [86], [87], [88] [2018-10-22 16:07:20,938 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:20,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:20,957 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:20,957 INFO L272 AbstractInterpreter]: Visited 24 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-10-22 16:07:20,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:20,979 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:21,036 INFO L232 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 69.47% of their original sizes. [2018-10-22 16:07:21,036 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:21,140 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-10-22 16:07:21,141 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:21,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 16:07:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 16:07:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-22 16:07:21,143 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 11 states. [2018-10-22 16:07:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:22,245 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-10-22 16:07:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 16:07:22,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-10-22 16:07:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:22,247 INFO L225 Difference]: With dead ends: 81 [2018-10-22 16:07:22,247 INFO L226 Difference]: Without dead ends: 74 [2018-10-22 16:07:22,248 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-10-22 16:07:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-22 16:07:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-22 16:07:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-22 16:07:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-10-22 16:07:22,265 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2018-10-22 16:07:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:22,266 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-10-22 16:07:22,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 16:07:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-10-22 16:07:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-22 16:07:22,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:22,267 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:22,267 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:22,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-10-22 16:07:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:22,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:22,270 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-22 16:07:22,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:22,428 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:22,429 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-22 16:07:22,429 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80] [2018-10-22 16:07:22,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:22,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:22,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:22,450 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-10-22 16:07:22,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:22,476 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:22,517 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 66.25% of their original sizes. [2018-10-22 16:07:22,517 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:22,814 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:22,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:22,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-10-22 16:07:22,815 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:22,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 16:07:22,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 16:07:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:07:22,817 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 14 states. [2018-10-22 16:07:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:24,615 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-10-22 16:07:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 16:07:24,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-10-22 16:07:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:24,617 INFO L225 Difference]: With dead ends: 83 [2018-10-22 16:07:24,617 INFO L226 Difference]: Without dead ends: 81 [2018-10-22 16:07:24,618 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-10-22 16:07:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-22 16:07:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-10-22 16:07:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-22 16:07:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-10-22 16:07:24,635 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 34 [2018-10-22 16:07:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:24,636 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-10-22 16:07:24,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 16:07:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-10-22 16:07:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-22 16:07:24,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:24,638 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:24,638 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:24,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1684026049, now seen corresponding path program 1 times [2018-10-22 16:07:24,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:24,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:24,640 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-22 16:07:24,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:24,790 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:24,790 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-22 16:07:24,790 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81] [2018-10-22 16:07:24,792 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:24,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:24,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:24,901 INFO L272 AbstractInterpreter]: Visited 27 different actions 249 times. Merged at 10 different actions 70 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-10-22 16:07:24,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:24,908 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:24,961 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 68.81% of their original sizes. [2018-10-22 16:07:24,961 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:25,715 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:25,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:25,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2018-10-22 16:07:25,716 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:25,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-22 16:07:25,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-22 16:07:25,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-22 16:07:25,717 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 19 states. [2018-10-22 16:07:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:28,167 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-10-22 16:07:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-22 16:07:28,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-10-22 16:07:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:28,171 INFO L225 Difference]: With dead ends: 86 [2018-10-22 16:07:28,171 INFO L226 Difference]: Without dead ends: 82 [2018-10-22 16:07:28,172 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-10-22 16:07:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-22 16:07:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-22 16:07:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-22 16:07:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-10-22 16:07:28,192 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 55 [2018-10-22 16:07:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:28,193 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-10-22 16:07:28,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-22 16:07:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-10-22 16:07:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-22 16:07:28,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:28,195 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:28,195 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:28,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-10-22 16:07:28,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:28,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:28,197 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-22 16:07:28,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:28,394 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:28,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-10-22 16:07:28,395 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [34], [39], [42], [44], [52], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-10-22 16:07:28,397 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:07:28,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:07:28,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:07:28,544 INFO L272 AbstractInterpreter]: Visited 36 different actions 449 times. Merged at 15 different actions 105 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-10-22 16:07:28,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:28,578 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:07:28,625 INFO L232 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 66.39% of their original sizes. [2018-10-22 16:07:28,625 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:07:28,991 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:07:28,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:07:28,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 25 [2018-10-22 16:07:28,992 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:07:28,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-22 16:07:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-22 16:07:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-10-22 16:07:28,993 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states. [2018-10-22 16:07:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:30,674 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-10-22 16:07:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 16:07:30,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-10-22 16:07:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:30,677 INFO L225 Difference]: With dead ends: 115 [2018-10-22 16:07:30,678 INFO L226 Difference]: Without dead ends: 102 [2018-10-22 16:07:30,678 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-10-22 16:07:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-22 16:07:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-22 16:07:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-22 16:07:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-10-22 16:07:30,708 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2018-10-22 16:07:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:30,709 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-10-22 16:07:30,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-22 16:07:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-10-22 16:07:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-22 16:07:30,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:07:30,715 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:07:30,715 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:07:30,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:07:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2122664945, now seen corresponding path program 2 times [2018-10-22 16:07:30,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:07:30,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:30,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:07:30,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:07:30,718 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:07:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:07:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-10-22 16:07:31,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:31,174 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:07:31,174 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 16:07:31,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 16:07:31,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:31,175 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 16:07:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 16:07:31,184 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 16:07:31,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 16:07:31,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 16:07:31,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:07:31,911 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-22 16:07:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 72 proven. 20 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-10-22 16:07:32,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:07:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 68 proven. 24 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-10-22 16:07:33,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:07:33,130 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 16:07:33,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 16:07:33,146 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 16:07:33,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 16:07:33,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 16:07:33,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:07:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-22 16:07:33,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:07:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 48 proven. 16 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-22 16:07:33,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 16:07:33,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11, 10] total 24 [2018-10-22 16:07:33,467 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 16:07:33,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-22 16:07:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-22 16:07:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-10-22 16:07:33,468 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 19 states. [2018-10-22 16:07:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:07:34,395 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-10-22 16:07:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 16:07:34,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-10-22 16:07:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:07:34,399 INFO L225 Difference]: With dead ends: 104 [2018-10-22 16:07:34,399 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 16:07:34,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 313 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2018-10-22 16:07:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 16:07:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 16:07:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 16:07:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 16:07:34,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2018-10-22 16:07:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:07:34,402 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 16:07:34,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-22 16:07:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 16:07:34,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 16:07:34,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 16:07:34,533 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 172 [2018-10-22 16:07:34,760 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 194 [2018-10-22 16:07:34,928 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 194 [2018-10-22 16:07:38,195 WARN L179 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 172 DAG size of output: 30 [2018-10-22 16:07:38,857 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 31 [2018-10-22 16:07:40,211 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 194 DAG size of output: 33 [2018-10-22 16:07:40,372 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2018-10-22 16:07:41,641 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 194 DAG size of output: 33 [2018-10-22 16:07:41,765 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2018-10-22 16:07:42,209 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 31 [2018-10-22 16:07:42,587 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 22 [2018-10-22 16:07:42,972 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 22 [2018-10-22 16:07:42,975 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 16:07:42,976 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:07:42,976 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:07:42,976 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 16:07:42,976 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 16:07:42,976 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 16:07:42,976 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-10-22 16:07:42,977 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-10-22 16:07:42,977 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-10-22 16:07:42,977 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-10-22 16:07:42,977 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-10-22 16:07:42,977 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-22 16:07:42,977 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= .cse4 4294967294)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse1 (<= 2 (* 2 main_~in~0)) .cse2 .cse3) (and (<= 2 .cse4) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644))))) [2018-10-22 16:07:42,977 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-22 16:07:42,978 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-10-22 16:07:42,978 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-10-22 16:07:42,978 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-22 16:07:42,978 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-10-22 16:07:42,978 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) .cse1 .cse2 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294) .cse3) (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= main_~inlen~0 (+ main_~buf~0 2147483647)) .cse3)))) [2018-10-22 16:07:42,978 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-10-22 16:07:42,978 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-22 16:07:42,979 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-10-22 16:07:42,979 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-10-22 16:07:42,979 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0))) (let ((.cse1 (<= .cse0 4294967294))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (let ((.cse3 (* 2 main_~in~0))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 2 .cse3) (<= .cse3 4294967288) .cse1 (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 (* 2 main_~buf~0))))))) [2018-10-22 16:07:42,979 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0))) (let ((.cse1 (<= .cse0 4294967294))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (let ((.cse3 (* 2 main_~in~0))) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 2 .cse3) (<= .cse3 4294967288) .cse1 (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 (* 2 main_~buf~0))))))) [2018-10-22 16:07:42,979 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-10-22 16:07:42,979 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-10-22 16:07:42,979 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-10-22 16:07:42,979 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-22 16:07:42,980 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse4 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= .cse4 4294967294)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse1 (<= 2 (* 2 main_~in~0)) .cse2 .cse3) (and (<= 2 .cse4) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644))))) [2018-10-22 16:07:42,980 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 16:07:42,980 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 16:07:42,980 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 16:07:42,980 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 16:07:42,980 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 16:07:42,980 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 16:07:42,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 04:07:42 BoogieIcfgContainer [2018-10-22 16:07:42,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 16:07:42,991 INFO L168 Benchmark]: Toolchain (without parser) took 29127.20 ms. Allocated memory was 1.6 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 811.9 MB. Max. memory is 7.1 GB. [2018-10-22 16:07:42,992 INFO L168 Benchmark]: CDTParser took 0.20 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-10-22 16:07:42,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.64 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-10-22 16:07:42,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.82 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-10-22 16:07:42,994 INFO L168 Benchmark]: Boogie Preprocessor took 41.14 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-10-22 16:07:42,994 INFO L168 Benchmark]: RCFGBuilder took 557.49 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-22 16:07:42,995 INFO L168 Benchmark]: TraceAbstraction took 28198.53 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 334.5 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -322.4 MB). Peak memory consumption was 849.3 MB. Max. memory is 7.1 GB. [2018-10-22 16:07:43,000 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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 302.64 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 Procedure Inliner took 22.82 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. * Boogie Preprocessor took 41.14 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 557.49 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28198.53 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 334.5 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -322.4 MB). Peak memory consumption was 849.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: 23]: Loop Invariant Derived loop invariant: (((((((in <= buf && bufferlen <= buflim + 2) && buf <= in) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && 2 <= 2 * in) && 2 * inlen <= 4294967294) && buf + 2 <= bufferlen) || ((((((bufferlen <= buflim + 2 && buf == 0) && in == 0) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && inlen <= buf + 2147483647) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 28.1s OverallTime, 9 OverallIterations, 12 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 8.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 525 SDslu, 1370 SDs, 0 SdLazy, 638 SolverSat, 570 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 627 GetRequests, 474 SyntacticMatches, 14 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9108223490510488 AbsIntWeakeningRatio, 0.5201793721973094 AbsIntAvgWeakeningVarsNumRemoved, 10.506726457399104 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 50 PreInvPairs, 83 NumberOfFragments, 552 HoareAnnotationTreeSize, 50 FomulaSimplifications, 6835 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 15 FomulaSimplificationsInter, 6662 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 211406 SizeOfPredicates, 11 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 1324/1518 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...