java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:13:48,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:13:48,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:13:48,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:13:48,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:13:48,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:13:48,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:13:48,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:13:48,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:13:48,938 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:13:48,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:13:48,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:13:48,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:13:48,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:13:48,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:13:48,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:13:48,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:13:48,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:13:48,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:13:48,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:13:48,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:13:48,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:13:48,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:13:48,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:13:48,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:13:48,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:13:48,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:13:48,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:13:48,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:13:48,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:13:48,961 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:13:48,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:13:48,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:13:48,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:13:48,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:13:48,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:13:48,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:13:48,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:13:48,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:13:48,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:13:48,984 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:13:48,984 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:13:48,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:13:48,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:13:48,984 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:13:48,984 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:13:48,985 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:13:48,985 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:13:48,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:13:48,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:13:48,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:13:48,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:13:48,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:13:48,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:13:48,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:13:48,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:13:48,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:13:48,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:13:48,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:13:48,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:13:48,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:13:48,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:13:48,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:13:48,989 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:13:48,990 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:13:49,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:13:49,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:13:49,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:13:49,071 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:13:49,072 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:13:49,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-09-10 10:13:49,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2082f0/78f74f77e5684e6fae46503c5eb21d25/FLAG5b396c86f [2018-09-10 10:13:49,561 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:13:49,562 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call_false-termination.i [2018-09-10 10:13:49,569 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2082f0/78f74f77e5684e6fae46503c5eb21d25/FLAG5b396c86f [2018-09-10 10:13:49,585 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2082f0/78f74f77e5684e6fae46503c5eb21d25 [2018-09-10 10:13:49,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:13:49,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:13:49,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:13:49,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:13:49,607 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:13:49,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17950296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49, skipping insertion in model container [2018-09-10 10:13:49,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,806 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:13:49,856 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:13:49,876 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:13:49,897 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:13:49,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49 WrapperNode [2018-09-10 10:13:49,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:13:49,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:13:49,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:13:49,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:13:49,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:13:49,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:13:49,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:13:49,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:13:49,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... [2018-09-10 10:13:49,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:13:49,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:13:49,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:13:49,994 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:13:49,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:13:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:13:50,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:13:50,053 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assert [2018-09-10 10:13:50,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assert [2018-09-10 10:13:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:13:50,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:13:50,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:13:50,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:13:50,571 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:13:50,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:13:50 BoogieIcfgContainer [2018-09-10 10:13:50,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:13:50,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:13:50,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:13:50,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:13:50,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:13:49" (1/3) ... [2018-09-10 10:13:50,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3b79bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:13:50, skipping insertion in model container [2018-09-10 10:13:50,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:49" (2/3) ... [2018-09-10 10:13:50,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3b79bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:13:50, skipping insertion in model container [2018-09-10 10:13:50,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:13:50" (3/3) ... [2018-09-10 10:13:50,580 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call_false-termination.i [2018-09-10 10:13:50,590 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:13:50,599 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:13:50,644 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:13:50,645 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:13:50,645 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:13:50,645 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:13:50,645 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:13:50,645 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:13:50,645 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:13:50,646 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:13:50,646 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:13:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-09-10 10:13:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-10 10:13:50,670 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:50,672 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:50,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash -61610569, now seen corresponding path program 1 times [2018-09-10 10:13:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:50,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:50,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:50,740 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:50,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:13:50,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:13:50,900 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:50,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:13:50,917 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:13:50,917 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:13:50,920 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2018-09-10 10:13:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:51,302 INFO L93 Difference]: Finished difference Result 91 states and 158 transitions. [2018-09-10 10:13:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:13:51,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-09-10 10:13:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:51,317 INFO L225 Difference]: With dead ends: 91 [2018-09-10 10:13:51,318 INFO L226 Difference]: Without dead ends: 48 [2018-09-10 10:13:51,322 INFO L604 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-09-10 10:13:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-10 10:13:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-09-10 10:13:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-10 10:13:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2018-09-10 10:13:51,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 15 [2018-09-10 10:13:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:51,383 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2018-09-10 10:13:51,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:13:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2018-09-10 10:13:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-10 10:13:51,385 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:51,386 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:51,386 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -39654602, now seen corresponding path program 1 times [2018-09-10 10:13:51,387 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:51,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:51,389 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:51,503 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:13:51,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-10 10:13:51,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:51,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:13:51,505 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:13:51,505 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-10 10:13:51,506 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand 5 states. [2018-09-10 10:13:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:51,713 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-09-10 10:13:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:13:51,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-09-10 10:13:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:51,719 INFO L225 Difference]: With dead ends: 58 [2018-09-10 10:13:51,719 INFO L226 Difference]: Without dead ends: 56 [2018-09-10 10:13:51,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-10 10:13:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-10 10:13:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-09-10 10:13:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-10 10:13:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-09-10 10:13:51,736 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 15 [2018-09-10 10:13:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:51,736 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-09-10 10:13:51,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:13:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-09-10 10:13:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-10 10:13:51,737 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:51,737 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:51,738 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash -748169685, now seen corresponding path program 1 times [2018-09-10 10:13:51,738 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:51,740 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:51,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:51,968 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:51,977 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:52,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:52,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:52,135 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:52,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 9 [2018-09-10 10:13:52,135 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:52,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:13:52,136 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:13:52,136 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:13:52,137 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 5 states. [2018-09-10 10:13:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:52,326 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-09-10 10:13:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:13:52,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-10 10:13:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:52,329 INFO L225 Difference]: With dead ends: 58 [2018-09-10 10:13:52,329 INFO L226 Difference]: Without dead ends: 56 [2018-09-10 10:13:52,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:13:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-10 10:13:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-10 10:13:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-10 10:13:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-09-10 10:13:52,343 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 20 [2018-09-10 10:13:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:52,344 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-09-10 10:13:52,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:13:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-09-10 10:13:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-10 10:13:52,345 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:52,345 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:52,346 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -813385546, now seen corresponding path program 1 times [2018-09-10 10:13:52,346 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:52,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:52,348 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-10 10:13:52,837 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:52,837 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:52,847 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:52,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:13:52,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:13:53,059 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:53,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 13 [2018-09-10 10:13:53,059 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:53,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:13:53,060 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:13:53,060 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-10 10:13:53,061 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand 6 states. [2018-09-10 10:13:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:53,305 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-09-10 10:13:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:13:53,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-09-10 10:13:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:53,307 INFO L225 Difference]: With dead ends: 62 [2018-09-10 10:13:53,307 INFO L226 Difference]: Without dead ends: 60 [2018-09-10 10:13:53,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:13:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-10 10:13:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-10 10:13:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-10 10:13:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-09-10 10:13:53,320 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 25 [2018-09-10 10:13:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:53,321 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-09-10 10:13:53,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:13:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-09-10 10:13:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-10 10:13:53,322 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:53,322 INFO L376 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] [2018-09-10 10:13:53,323 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1935321332, now seen corresponding path program 1 times [2018-09-10 10:13:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:53,325 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:13:53,473 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:53,474 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:53,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:53,484 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:53,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:13:53,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-10 10:13:53,612 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:53,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 9 [2018-09-10 10:13:53,612 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:53,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-10 10:13:53,613 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-10 10:13:53,613 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:13:53,613 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 5 states. [2018-09-10 10:13:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:53,843 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-09-10 10:13:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:13:53,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-09-10 10:13:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:53,846 INFO L225 Difference]: With dead ends: 68 [2018-09-10 10:13:53,846 INFO L226 Difference]: Without dead ends: 66 [2018-09-10 10:13:53,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:13:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-10 10:13:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-09-10 10:13:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-10 10:13:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-09-10 10:13:53,859 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 30 [2018-09-10 10:13:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:53,860 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2018-09-10 10:13:53,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-10 10:13:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-09-10 10:13:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-10 10:13:53,862 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:53,862 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 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-09-10 10:13:53,862 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1082472865, now seen corresponding path program 1 times [2018-09-10 10:13:53,863 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:53,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:53,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:53,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:53,864 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:13:53,988 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:53,989 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:54,000 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:54,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:13:54,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:13:54,256 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:54,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-09-10 10:13:54,256 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:54,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-10 10:13:54,257 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-10 10:13:54,257 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:13:54,258 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 6 states. [2018-09-10 10:13:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:54,452 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-09-10 10:13:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-10 10:13:54,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-09-10 10:13:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:54,460 INFO L225 Difference]: With dead ends: 78 [2018-09-10 10:13:54,461 INFO L226 Difference]: Without dead ends: 76 [2018-09-10 10:13:54,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-10 10:13:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-10 10:13:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-09-10 10:13:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-10 10:13:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2018-09-10 10:13:54,473 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 48 [2018-09-10 10:13:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:54,474 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-09-10 10:13:54,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-10 10:13:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2018-09-10 10:13:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-10 10:13:54,476 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:54,476 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:54,477 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash -492884639, now seen corresponding path program 1 times [2018-09-10 10:13:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:54,479 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-09-10 10:13:54,751 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:54,751 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:54,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:54,759 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-10 10:13:54,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-10 10:13:54,958 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:54,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2018-09-10 10:13:54,959 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:54,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:13:54,959 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:13:54,960 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-10 10:13:54,960 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 7 states. [2018-09-10 10:13:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:55,309 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-09-10 10:13:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:13:55,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-09-10 10:13:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:55,311 INFO L225 Difference]: With dead ends: 78 [2018-09-10 10:13:55,311 INFO L226 Difference]: Without dead ends: 76 [2018-09-10 10:13:55,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-09-10 10:13:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-10 10:13:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-09-10 10:13:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-10 10:13:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-09-10 10:13:55,338 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 58 [2018-09-10 10:13:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-09-10 10:13:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:13:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-09-10 10:13:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-10 10:13:55,344 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:55,344 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:55,345 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1144730545, now seen corresponding path program 1 times [2018-09-10 10:13:55,347 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:55,350 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-09-10 10:13:55,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:55,544 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:55,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:55,554 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:55,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-09-10 10:13:55,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-09-10 10:13:55,855 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-10 10:13:55,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 15 [2018-09-10 10:13:55,855 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:55,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:13:55,856 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:13:55,856 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:13:55,857 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 8 states. [2018-09-10 10:13:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:56,146 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-09-10 10:13:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:13:56,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-09-10 10:13:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:56,148 INFO L225 Difference]: With dead ends: 76 [2018-09-10 10:13:56,149 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:13:56,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-09-10 10:13:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:13:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:13:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:13:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:13:56,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-09-10 10:13:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:56,152 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:13:56,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:13:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:13:56,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:13:56,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:13:56,625 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-10 10:13:56,625 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:13:56,625 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_invgen_SpamAssassin_loop_true_unreach_call_false_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:13:56,626 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-10 10:13:56,626 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:13:56,626 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:13:56,627 INFO L422 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,627 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 10 53) no Hoare annotation was computed. [2018-09-10 10:13:56,627 INFO L422 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,627 INFO L422 ceAbstractionStarter]: At program point L23-1(line 23) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,627 INFO L422 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,627 INFO L422 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,628 INFO L422 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,628 INFO L422 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,628 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-10 10:13:56,628 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 51) no Hoare annotation was computed. [2018-09-10 10:13:56,628 INFO L422 ceAbstractionStarter]: At program point L20-3(lines 20 51) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,628 INFO L426 ceAbstractionStarter]: For program point L20-4(lines 20 51) no Hoare annotation was computed. [2018-09-10 10:13:56,629 INFO L422 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,629 INFO L422 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,629 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-10 10:13:56,629 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-10 10:13:56,629 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 21 50) no Hoare annotation was computed. [2018-09-10 10:13:56,630 INFO L422 ceAbstractionStarter]: At program point L21-3(lines 21 50) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,630 INFO L426 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-09-10 10:13:56,630 INFO L426 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-09-10 10:13:56,630 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 10 53) no Hoare annotation was computed. [2018-09-10 10:13:56,630 INFO L422 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,630 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,631 INFO L422 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,631 INFO L422 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,631 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 10 53) the Hoare annotation is: true [2018-09-10 10:13:56,631 INFO L422 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,632 INFO L422 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 2) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,632 INFO L426 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2018-09-10 10:13:56,632 INFO L422 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) (<= (+ main_~j~0 5) main_~bufsize~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2018-09-10 10:13:56,632 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-10 10:13:56,632 INFO L426 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-09-10 10:13:56,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:13:56 BoogieIcfgContainer [2018-09-10 10:13:56,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:13:56,646 INFO L168 Benchmark]: Toolchain (without parser) took 7049.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -313.7 MB). Peak memory consumption was 436.1 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:56,648 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:13:56,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:56,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:13:56,650 INFO L168 Benchmark]: Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-10 10:13:56,651 INFO L168 Benchmark]: RCFGBuilder took 580.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:56,652 INFO L168 Benchmark]: TraceAbstraction took 6072.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 468.6 MB). Peak memory consumption was 468.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:56,657 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 580.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6072.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 468.6 MB). Peak memory consumption was 468.6 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: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((0 <= j && 0 <= i) && i + 1 <= len) && j + 5 <= bufsize) && limit + 4 <= bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 8 OverallIterations, 11 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 114 SDslu, 1106 SDs, 0 SdLazy, 536 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 496 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 369 HoareAnnotationTreeSize, 55 FomulaSimplifications, 537 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 81138 SizeOfPredicates, 23 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1206/1284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/SpamAssassin-loop_true-unreach-call_false-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-13-56-672.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/SpamAssassin-loop_true-unreach-call_false-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-13-56-672.csv Received shutdown request...