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-EXP.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:17:57,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:17:57,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:17:57,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:17:57,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:17:57,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:17:57,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:17:57,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:17:57,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:17:57,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:17:57,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:17:57,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:17:57,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:17:57,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:17:57,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:17:57,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:17:57,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:17:57,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:17:57,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:17:57,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:17:57,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:17:57,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:17:57,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:17:57,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:17:57,535 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:17:57,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:17:57,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:17:57,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:17:57,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:17:57,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:17:57,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:17:57,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:17:57,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:17:57,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:17:57,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:17:57,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:17:57,548 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 02:17:57,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:17:57,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:17:57,577 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:17:57,578 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:17:57,578 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:17:57,578 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:17:57,578 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:17:57,578 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:17:57,579 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:17:57,579 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:17:57,579 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:17:57,580 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:17:57,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:17:57,580 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:17:57,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:17:57,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:17:57,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:17:57,581 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:17:57,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:17:57,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:17:57,582 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:17:57,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:17:57,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:17:57,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:17:57,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:17:57,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:17:57,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:17:57,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:17:57,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:17:57,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:17:57,585 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:17:57,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:17:57,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:17:57,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:17:57,586 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:17:57,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:17:57,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:17:57,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:17:57,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:17:57,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:17:57,659 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:17:57,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:17:57,716 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dab1be481/001630bbce03481996577573e8f44618/FLAG1aff6231b [2018-10-25 02:17:58,193 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:17:58,194 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:17:58,206 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dab1be481/001630bbce03481996577573e8f44618/FLAG1aff6231b [2018-10-25 02:17:58,220 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dab1be481/001630bbce03481996577573e8f44618 [2018-10-25 02:17:58,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:17:58,232 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:17:58,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:58,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:17:58,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:17:58,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f3d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58, skipping insertion in model container [2018-10-25 02:17:58,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:17:58,320 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:17:58,660 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:58,668 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:17:58,756 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:58,780 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:17:58,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58 WrapperNode [2018-10-25 02:17:58,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:58,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:58,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:17:58,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:17:58,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:58,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:17:58,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:17:58,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:17:58,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (1/1) ... [2018-10-25 02:17:58,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:17:58,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:17:58,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:17:58,967 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:17:58,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (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-25 02:17:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:17:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:17:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:17:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:17:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:17:59,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:18:00,904 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:18:00,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:18:00 BoogieIcfgContainer [2018-10-25 02:18:00,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:18:00,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:18:00,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:18:00,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:18:00,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:17:58" (1/3) ... [2018-10-25 02:18:00,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d377223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:18:00, skipping insertion in model container [2018-10-25 02:18:00,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:58" (2/3) ... [2018-10-25 02:18:00,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d377223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:18:00, skipping insertion in model container [2018-10-25 02:18:00,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:18:00" (3/3) ... [2018-10-25 02:18:00,913 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-25 02:18:00,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:18:00,929 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:18:00,941 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:18:00,975 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:18:00,975 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:18:00,975 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:18:00,976 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:18:00,976 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:18:00,977 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:18:00,977 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:18:00,977 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:18:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-25 02:18:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-25 02:18:01,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:01,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:01,009 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:01,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-10-25 02:18:01,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:01,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:01,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,065 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:01,163 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-25 02:18:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-25 02:18:01,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:01,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-25 02:18:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-25 02:18:01,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-25 02:18:01,185 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-10-25 02:18:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:01,233 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-10-25 02:18:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-25 02:18:01,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-25 02:18:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:01,247 INFO L225 Difference]: With dead ends: 222 [2018-10-25 02:18:01,247 INFO L226 Difference]: Without dead ends: 104 [2018-10-25 02:18:01,251 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-25 02:18:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-25 02:18:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-25 02:18:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-25 02:18:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-10-25 02:18:01,303 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-10-25 02:18:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:01,304 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-10-25 02:18:01,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-25 02:18:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-10-25 02:18:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-25 02:18:01,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:01,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:01,308 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:01,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-10-25 02:18:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:01,407 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-25 02:18:01,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:01,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:01,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:01,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:01,411 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-10-25 02:18:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:01,682 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-10-25 02:18:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:01,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-25 02:18:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:01,686 INFO L225 Difference]: With dead ends: 205 [2018-10-25 02:18:01,686 INFO L226 Difference]: Without dead ends: 107 [2018-10-25 02:18:01,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-25 02:18:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-25 02:18:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-25 02:18:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-10-25 02:18:01,717 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-10-25 02:18:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:01,717 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-10-25 02:18:01,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-10-25 02:18:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-25 02:18:01,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:01,720 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:01,720 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:01,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-10-25 02:18:01,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:01,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:01,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:01,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:01,961 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-10-25 02:18:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:02,519 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-10-25 02:18:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:02,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-25 02:18:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:02,523 INFO L225 Difference]: With dead ends: 209 [2018-10-25 02:18:02,523 INFO L226 Difference]: Without dead ends: 190 [2018-10-25 02:18:02,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-25 02:18:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-10-25 02:18:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-25 02:18:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-10-25 02:18:02,540 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-10-25 02:18:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:02,540 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-10-25 02:18:02,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-10-25 02:18:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-25 02:18:02,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:02,542 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:02,542 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:02,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-10-25 02:18:02,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:02,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:02,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:02,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:02,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:02,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:02,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:02,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:02,641 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-10-25 02:18:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:02,737 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-10-25 02:18:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:02,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-25 02:18:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:02,739 INFO L225 Difference]: With dead ends: 297 [2018-10-25 02:18:02,740 INFO L226 Difference]: Without dead ends: 128 [2018-10-25 02:18:02,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-25 02:18:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-25 02:18:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-25 02:18:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-10-25 02:18:02,752 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-10-25 02:18:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:02,752 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-10-25 02:18:02,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-10-25 02:18:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-25 02:18:02,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:02,754 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:02,754 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:02,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-10-25 02:18:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:02,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:18:02,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:02,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:02,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:02,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:02,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:02,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:02,900 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-10-25 02:18:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:03,159 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-10-25 02:18:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:03,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-25 02:18:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:03,161 INFO L225 Difference]: With dead ends: 230 [2018-10-25 02:18:03,162 INFO L226 Difference]: Without dead ends: 111 [2018-10-25 02:18:03,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-25 02:18:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-25 02:18:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-25 02:18:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-10-25 02:18:03,187 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-10-25 02:18:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:03,187 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-10-25 02:18:03,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-10-25 02:18:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-25 02:18:03,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:03,192 INFO L375 BasicCegarLoop]: trace histogram [3, 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-25 02:18:03,192 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:03,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-10-25 02:18:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:03,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:03,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:03,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:03,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:03,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-25 02:18:03,350 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-10-25 02:18:03,384 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:03,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:04,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:04,186 INFO L272 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 14 different actions 24 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 39 variables. [2018-10-25 02:18:04,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:04,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:04,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:04,234 INFO L194 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-25 02:18:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:04,249 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:04,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:04,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-25 02:18:04,803 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:04,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:18:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:18:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:18:04,805 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-10-25 02:18:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:05,178 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-10-25 02:18:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:18:05,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-25 02:18:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:05,181 INFO L225 Difference]: With dead ends: 192 [2018-10-25 02:18:05,181 INFO L226 Difference]: Without dead ends: 174 [2018-10-25 02:18:05,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:18:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-25 02:18:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-10-25 02:18:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-25 02:18:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-10-25 02:18:05,192 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-10-25 02:18:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:05,193 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-10-25 02:18:05,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:18:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-10-25 02:18:05,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-25 02:18:05,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:05,195 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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-25 02:18:05,195 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:05,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:05,195 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-10-25 02:18:05,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:05,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:05,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:05,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:05,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-25 02:18:05,357 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [520], [523], [524], [525] [2018-10-25 02:18:05,360 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:05,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:05,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:05,694 INFO L272 AbstractInterpreter]: Visited 25 different actions 57 times. Merged at 15 different actions 25 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-25 02:18:05,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:05,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:05,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:05,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:18:05,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:05,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:05,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:06,330 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-25 02:18:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:06,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:06,756 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-25 02:18:07,181 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 19 [2018-10-25 02:18:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:18:07,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 02:18:07,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 7 [2018-10-25 02:18:07,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:07,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:18:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:18:07,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:18:07,228 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 4 states. [2018-10-25 02:18:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:07,746 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2018-10-25 02:18:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:18:07,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-25 02:18:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:07,749 INFO L225 Difference]: With dead ends: 289 [2018-10-25 02:18:07,750 INFO L226 Difference]: Without dead ends: 280 [2018-10-25 02:18:07,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:18:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-25 02:18:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2018-10-25 02:18:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-25 02:18:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 408 transitions. [2018-10-25 02:18:07,767 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 408 transitions. Word has length 28 [2018-10-25 02:18:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:07,767 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 408 transitions. [2018-10-25 02:18:07,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:18:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 408 transitions. [2018-10-25 02:18:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-25 02:18:07,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:07,769 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-25 02:18:07,770 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:07,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-10-25 02:18:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:07,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:18:07,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:07,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:07,842 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:07,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:07,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:07,843 INFO L87 Difference]: Start difference. First operand 262 states and 408 transitions. Second operand 3 states. [2018-10-25 02:18:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:07,997 INFO L93 Difference]: Finished difference Result 454 states and 703 transitions. [2018-10-25 02:18:07,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:07,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-25 02:18:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:08,000 INFO L225 Difference]: With dead ends: 454 [2018-10-25 02:18:08,000 INFO L226 Difference]: Without dead ends: 220 [2018-10-25 02:18:08,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-25 02:18:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-25 02:18:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-25 02:18:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 326 transitions. [2018-10-25 02:18:08,018 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 326 transitions. Word has length 29 [2018-10-25 02:18:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:08,019 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 326 transitions. [2018-10-25 02:18:08,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 326 transitions. [2018-10-25 02:18:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-25 02:18:08,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:08,020 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-25 02:18:08,020 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:08,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-10-25 02:18:08,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:08,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:08,875 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-25 02:18:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:08,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:08,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:08,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-25 02:18:08,881 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-10-25 02:18:08,883 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:08,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:09,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:09,182 INFO L272 AbstractInterpreter]: Visited 28 different actions 63 times. Merged at 18 different actions 28 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 43 variables. [2018-10-25 02:18:09,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:09,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:09,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:09,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:18:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:09,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:09,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 02:18:09,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 02:18:09,781 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:18:09,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-25 02:18:09,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:09,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:09,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:09,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:18:09,783 INFO L87 Difference]: Start difference. First operand 218 states and 326 transitions. Second operand 3 states. [2018-10-25 02:18:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:09,829 INFO L93 Difference]: Finished difference Result 221 states and 328 transitions. [2018-10-25 02:18:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:09,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-25 02:18:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:09,831 INFO L225 Difference]: With dead ends: 221 [2018-10-25 02:18:09,831 INFO L226 Difference]: Without dead ends: 215 [2018-10-25 02:18:09,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:18:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-25 02:18:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-10-25 02:18:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-25 02:18:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 317 transitions. [2018-10-25 02:18:09,840 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 317 transitions. Word has length 31 [2018-10-25 02:18:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:09,841 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 317 transitions. [2018-10-25 02:18:09,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 317 transitions. [2018-10-25 02:18:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-25 02:18:09,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:09,842 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 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] [2018-10-25 02:18:09,843 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:09,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-10-25 02:18:09,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:09,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:09,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 02:18:09,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:09,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:09,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:09,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:09,930 INFO L87 Difference]: Start difference. First operand 214 states and 317 transitions. Second operand 3 states. [2018-10-25 02:18:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:10,138 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2018-10-25 02:18:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:10,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-25 02:18:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:10,140 INFO L225 Difference]: With dead ends: 363 [2018-10-25 02:18:10,141 INFO L226 Difference]: Without dead ends: 177 [2018-10-25 02:18:10,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-25 02:18:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-25 02:18:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-25 02:18:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2018-10-25 02:18:10,148 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 36 [2018-10-25 02:18:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:10,148 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2018-10-25 02:18:10,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2018-10-25 02:18:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-25 02:18:10,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:10,150 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2018-10-25 02:18:10,150 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:10,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-10-25 02:18:10,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:10,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:18:10,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:10,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:10,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-25 02:18:10,482 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-10-25 02:18:10,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:10,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:10,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:10,699 INFO L272 AbstractInterpreter]: Visited 30 different actions 64 times. Merged at 16 different actions 26 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 7 different actions. Largest state had 41 variables. [2018-10-25 02:18:10,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:10,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:10,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:10,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:18:10,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:10,753 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:10,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:18:10,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:18:11,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:11,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-25 02:18:11,303 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:11,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:18:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:18:11,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:18:11,305 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand 5 states. [2018-10-25 02:18:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:11,605 INFO L93 Difference]: Finished difference Result 252 states and 370 transitions. [2018-10-25 02:18:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 02:18:11,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-25 02:18:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:11,608 INFO L225 Difference]: With dead ends: 252 [2018-10-25 02:18:11,608 INFO L226 Difference]: Without dead ends: 247 [2018-10-25 02:18:11,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 02:18:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-25 02:18:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2018-10-25 02:18:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-25 02:18:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 356 transitions. [2018-10-25 02:18:11,617 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 356 transitions. Word has length 37 [2018-10-25 02:18:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:11,618 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 356 transitions. [2018-10-25 02:18:11,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:18:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 356 transitions. [2018-10-25 02:18:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-25 02:18:11,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:11,619 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:11,619 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:11,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-10-25 02:18:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:11,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:11,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:11,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:11,839 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:12,005 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:12,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:12,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:12,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-25 02:18:12,093 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-10-25 02:18:12,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:12,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:12,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:12,344 INFO L272 AbstractInterpreter]: Visited 33 different actions 67 times. Merged at 16 different actions 26 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 7 different actions. Largest state had 44 variables. [2018-10-25 02:18:12,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:12,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:12,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:12,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:18:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:12,404 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:12,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:12,647 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-25 02:18:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:12,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:12,937 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 23 [2018-10-25 02:18:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:13,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-10-25 02:18:13,453 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:13,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:18:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:18:13,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 02:18:13,454 INFO L87 Difference]: Start difference. First operand 241 states and 356 transitions. Second operand 6 states. [2018-10-25 02:18:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:13,686 INFO L93 Difference]: Finished difference Result 251 states and 365 transitions. [2018-10-25 02:18:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:18:13,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-25 02:18:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:13,689 INFO L225 Difference]: With dead ends: 251 [2018-10-25 02:18:13,690 INFO L226 Difference]: Without dead ends: 249 [2018-10-25 02:18:13,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 02:18:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-25 02:18:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2018-10-25 02:18:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-25 02:18:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 357 transitions. [2018-10-25 02:18:13,700 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 357 transitions. Word has length 40 [2018-10-25 02:18:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:13,700 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 357 transitions. [2018-10-25 02:18:13,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:18:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 357 transitions. [2018-10-25 02:18:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-25 02:18:13,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:13,701 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:13,701 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:13,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-10-25 02:18:13,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:13,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 02:18:13,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:13,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:13,789 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:13,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:13,790 INFO L87 Difference]: Start difference. First operand 242 states and 357 transitions. Second operand 3 states. [2018-10-25 02:18:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:14,068 INFO L93 Difference]: Finished difference Result 422 states and 620 transitions. [2018-10-25 02:18:14,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:14,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-25 02:18:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:14,070 INFO L225 Difference]: With dead ends: 422 [2018-10-25 02:18:14,070 INFO L226 Difference]: Without dead ends: 226 [2018-10-25 02:18:14,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-25 02:18:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-25 02:18:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-25 02:18:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 320 transitions. [2018-10-25 02:18:14,080 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 320 transitions. Word has length 41 [2018-10-25 02:18:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:14,080 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 320 transitions. [2018-10-25 02:18:14,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 320 transitions. [2018-10-25 02:18:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-25 02:18:14,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:14,081 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 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] [2018-10-25 02:18:14,082 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:14,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-10-25 02:18:14,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:14,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-25 02:18:14,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:14,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:14,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:14,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:14,159 INFO L87 Difference]: Start difference. First operand 224 states and 320 transitions. Second operand 3 states. [2018-10-25 02:18:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:14,416 INFO L93 Difference]: Finished difference Result 305 states and 435 transitions. [2018-10-25 02:18:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:14,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-25 02:18:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:14,418 INFO L225 Difference]: With dead ends: 305 [2018-10-25 02:18:14,418 INFO L226 Difference]: Without dead ends: 146 [2018-10-25 02:18:14,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-25 02:18:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-25 02:18:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-25 02:18:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2018-10-25 02:18:14,426 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 50 [2018-10-25 02:18:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:14,426 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2018-10-25 02:18:14,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2018-10-25 02:18:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-25 02:18:14,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:14,427 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1] [2018-10-25 02:18:14,427 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:14,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-10-25 02:18:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:14,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:18:14,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:14,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:14,826 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-25 02:18:14,827 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-10-25 02:18:14,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:14,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:15,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:15,135 INFO L272 AbstractInterpreter]: Visited 39 different actions 74 times. Merged at 17 different actions 27 times. Widened at 2 different actions 2 times. Found 10 fixpoints after 7 different actions. Largest state had 46 variables. [2018-10-25 02:18:15,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:15,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:15,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:15,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 02:18:15,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:15,198 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:15,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:15,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:15,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-10-25 02:18:15,726 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:15,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 02:18:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 02:18:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-25 02:18:15,728 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand 9 states. [2018-10-25 02:18:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:16,220 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-10-25 02:18:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 02:18:16,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-25 02:18:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:16,225 INFO L225 Difference]: With dead ends: 187 [2018-10-25 02:18:16,225 INFO L226 Difference]: Without dead ends: 183 [2018-10-25 02:18:16,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-25 02:18:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-25 02:18:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-10-25 02:18:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-25 02:18:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2018-10-25 02:18:16,238 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 51 [2018-10-25 02:18:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:16,239 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2018-10-25 02:18:16,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 02:18:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2018-10-25 02:18:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-25 02:18:16,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:16,240 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2018-10-25 02:18:16,240 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:16,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-10-25 02:18:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:16,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:16,515 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:16,690 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:17,189 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-25 02:18:17,411 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 02:18:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:17,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:17,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:17,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-25 02:18:17,633 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-25 02:18:17,636 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:17,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:18,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:18,031 INFO L272 AbstractInterpreter]: Visited 44 different actions 84 times. Merged at 20 different actions 32 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:18:18,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:18,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:18,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:18,057 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:18,068 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:18,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:18,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:18,721 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 22 [2018-10-25 02:18:19,473 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-10-25 02:18:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:18:19,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:19,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-25 02:18:19,526 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:19,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 02:18:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 02:18:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-25 02:18:19,527 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand 9 states. [2018-10-25 02:18:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:20,148 INFO L93 Difference]: Finished difference Result 184 states and 255 transitions. [2018-10-25 02:18:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 02:18:20,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-25 02:18:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:20,150 INFO L225 Difference]: With dead ends: 184 [2018-10-25 02:18:20,151 INFO L226 Difference]: Without dead ends: 182 [2018-10-25 02:18:20,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-25 02:18:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-25 02:18:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-25 02:18:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-25 02:18:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2018-10-25 02:18:20,159 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 61 [2018-10-25 02:18:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:20,160 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2018-10-25 02:18:20,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 02:18:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2018-10-25 02:18:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-25 02:18:20,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:20,161 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:20,161 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:20,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-10-25 02:18:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:20,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:20,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-25 02:18:20,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:20,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:20,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-10-25 02:18:20,891 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-25 02:18:20,896 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:20,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:21,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:21,219 INFO L272 AbstractInterpreter]: Visited 46 different actions 82 times. Merged at 18 different actions 28 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:18:21,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:21,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:21,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:21,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:21,273 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:21,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-25 02:18:21,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:22,103 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 12 [2018-10-25 02:18:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-25 02:18:22,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:22,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-10-25 02:18:22,290 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:22,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 02:18:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 02:18:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:18:22,291 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand 7 states. [2018-10-25 02:18:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:22,419 INFO L93 Difference]: Finished difference Result 223 states and 308 transitions. [2018-10-25 02:18:22,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:18:22,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-10-25 02:18:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:22,421 INFO L225 Difference]: With dead ends: 223 [2018-10-25 02:18:22,421 INFO L226 Difference]: Without dead ends: 220 [2018-10-25 02:18:22,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:18:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-25 02:18:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-25 02:18:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-25 02:18:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 302 transitions. [2018-10-25 02:18:22,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 302 transitions. Word has length 79 [2018-10-25 02:18:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:22,430 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 302 transitions. [2018-10-25 02:18:22,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 02:18:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 302 transitions. [2018-10-25 02:18:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-25 02:18:22,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:22,431 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2018-10-25 02:18:22,431 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:22,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-10-25 02:18:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:22,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:22,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:22,723 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:22,902 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:23,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:23,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:23,077 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-10-25 02:18:23,077 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-25 02:18:23,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:23,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:23,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:23,533 INFO L272 AbstractInterpreter]: Visited 44 different actions 80 times. Merged at 18 different actions 28 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:18:23,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:23,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:23,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:23,553 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:23,561 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:23,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:23,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:24,016 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 26 [2018-10-25 02:18:25,638 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-25 02:18:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-25 02:18:25,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:25,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2018-10-25 02:18:25,760 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:25,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 02:18:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 02:18:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:18:25,761 INFO L87 Difference]: Start difference. First operand 217 states and 302 transitions. Second operand 10 states. [2018-10-25 02:18:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:26,001 INFO L93 Difference]: Finished difference Result 220 states and 305 transitions. [2018-10-25 02:18:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 02:18:26,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-10-25 02:18:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:26,004 INFO L225 Difference]: With dead ends: 220 [2018-10-25 02:18:26,004 INFO L226 Difference]: Without dead ends: 218 [2018-10-25 02:18:26,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:18:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-25 02:18:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-10-25 02:18:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-25 02:18:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2018-10-25 02:18:26,013 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 82 [2018-10-25 02:18:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:26,013 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2018-10-25 02:18:26,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 02:18:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2018-10-25 02:18:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-25 02:18:26,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:26,015 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-10-25 02:18:26,015 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:26,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-10-25 02:18:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:26,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-25 02:18:26,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:26,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:26,812 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-10-25 02:18:26,812 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-10-25 02:18:26,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:18:26,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:18:27,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:18:27,098 INFO L272 AbstractInterpreter]: Visited 46 different actions 82 times. Merged at 18 different actions 28 times. Widened at 3 different actions 3 times. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-10-25 02:18:27,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:27,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:18:27,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:27,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:27,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:27,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:18:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:27,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:27,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-25 02:18:27,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:27,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-10-25 02:18:27,724 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:27,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 02:18:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 02:18:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:27,725 INFO L87 Difference]: Start difference. First operand 218 states and 303 transitions. Second operand 15 states. [2018-10-25 02:18:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:28,345 INFO L93 Difference]: Finished difference Result 261 states and 363 transitions. [2018-10-25 02:18:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 02:18:28,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-10-25 02:18:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:28,349 INFO L225 Difference]: With dead ends: 261 [2018-10-25 02:18:28,349 INFO L226 Difference]: Without dead ends: 257 [2018-10-25 02:18:28,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-10-25 02:18:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-25 02:18:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-10-25 02:18:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-25 02:18:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2018-10-25 02:18:28,360 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 93 [2018-10-25 02:18:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:28,360 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2018-10-25 02:18:28,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 02:18:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2018-10-25 02:18:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-25 02:18:28,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:28,361 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 02:18:28,362 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:28,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-10-25 02:18:28,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:28,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:28,676 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:28,835 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 02:18:29,299 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-25 02:18:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:29,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:18:29,663 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-25 02:18:29,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-25 02:18:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:18:29,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:18:29,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-25 02:18:29,670 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-25 02:18:29,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-25 02:18:29,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-25 02:18:29,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:18:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-25 02:18:30,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:18:30,597 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 22 [2018-10-25 02:18:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-25 02:18:31,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:18:31,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2018-10-25 02:18:31,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:18:31,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 02:18:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 02:18:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-10-25 02:18:31,149 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand 18 states. [2018-10-25 02:18:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:32,179 INFO L93 Difference]: Finished difference Result 268 states and 369 transitions. [2018-10-25 02:18:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-25 02:18:32,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-10-25 02:18:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:32,181 INFO L225 Difference]: With dead ends: 268 [2018-10-25 02:18:32,181 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 02:18:32,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-10-25 02:18:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 02:18:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 02:18:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 02:18:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 02:18:32,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-10-25 02:18:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:32,183 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 02:18:32,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 02:18:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 02:18:32,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 02:18:32,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 02:18:32,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 02:18:32,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 02:18:33,217 WARN L179 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-10-25 02:18:33,330 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-25 02:18:33,331 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-10-25 02:18:33,331 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-10-25 02:18:33,332 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-10-25 02:18:33,333 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-10-25 02:18:33,334 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-10-25 02:18:33,335 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-10-25 02:18:33,336 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-10-25 02:18:33,337 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-10-25 02:18:33,338 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse3 (<= main_~this_buffer_empty~0 1)) (.cse5 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse4 (<= 0 (+ main_~P8~0 2147483648))) (.cse6 (<= main_~P8~0 2147483647)) (.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod (+ main_~this_expect~0 1) 2))))) .cse3 .cse4 .cse5 (= main_~q~0 4) .cse6) (and (= 0 (mod (+ main_~this_expect~0 1) 2)) .cse4 (= main_~q~0 3) .cse6 .cse0 .cse1) (and .cse7 (= main_~q~0 1) .cse3 .cse4 .cse5 .cse6) (and .cse7 (<= 5 main_~q~0) .cse4 .cse6 .cse0 .cse1))) [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-10-25 02:18:33,339 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-10-25 02:18:33,340 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-25 02:18:33,341 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-10-25 02:18:33,342 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-10-25 02:18:33,342 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-10-25 02:18:33,342 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-10-25 02:18:33,342 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-10-25 02:18:33,342 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-10-25 02:18:33,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,361 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,363 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,364 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 02:18:33 BoogieIcfgContainer [2018-10-25 02:18:33,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 02:18:33,367 INFO L168 Benchmark]: Toolchain (without parser) took 35135.71 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:33,368 INFO L168 Benchmark]: CDTParser took 0.22 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-10-25 02:18:33,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.85 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:33,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.47 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-10-25 02:18:33,369 INFO L168 Benchmark]: Boogie Preprocessor took 157.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:33,370 INFO L168 Benchmark]: RCFGBuilder took 1938.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:33,371 INFO L168 Benchmark]: TraceAbstraction took 32459.91 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 399.0 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -342.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2018-10-25 02:18:33,375 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.22 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 547.85 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.47 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 157.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1938.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32459.91 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 399.0 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -342.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant [2018-10-25 02:18:33,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && q == 4) && P8 <= 2147483647)) || (((((0 == (this_expect + 1) % 2 && 0 <= P8 + 2147483648) && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-10-25 02:18:33,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-10-25 02:18:33,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 32.3s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3252 SDtfs, 2025 SDslu, 8802 SDs, 0 SdLazy, 1351 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1389 GetRequests, 1238 SyntacticMatches, 16 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 70 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 194 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1369 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 518 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2101 ConstructedInterpolants, 324 QuantifiedInterpolants, 1639567 SizeOfPredicates, 55 NumberOfNonLiveVariables, 4088 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 901/2194 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...