java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-673a906-m
[2019-10-02 20:31:35,814 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-10-02 20:31:35,816 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-02 20:31:35,828 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-02 20:31:35,829 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-02 20:31:35,830 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-02 20:31:35,831 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-02 20:31:35,833 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-02 20:31:35,834 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-02 20:31:35,835 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-02 20:31:35,836 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-10-02 20:31:35,837 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-02 20:31:35,838 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-02 20:31:35,839 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-02 20:31:35,840 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-02 20:31:35,841 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-02 20:31:35,842 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-02 20:31:35,843 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-02 20:31:35,844 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-02 20:31:35,847 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-02 20:31:35,848 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-02 20:31:35,849 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-02 20:31:35,850 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-10-02 20:31:35,851 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-02 20:31:35,854 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-02 20:31:35,854 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-02 20:31:35,854 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-02 20:31:35,855 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-02 20:31:35,856 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-02 20:31:35,857 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-02 20:31:35,857 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-02 20:31:35,858 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-02 20:31:35,859 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-02 20:31:35,859 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-02 20:31:35,861 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-02 20:31:35,861 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-02 20:31:35,862 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-02 20:31:35,862 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-02 20:31:35,862 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-02 20:31:35,863 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-02 20:31:35,864 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-10-02 20:31:35,865 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf
[2019-10-02 20:31:35,891 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-10-02 20:31:35,891 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-02 20:31:35,891 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2019-10-02 20:31:35,891 INFO  L138        SettingsManager]:  * Log level for plugins=info
[2019-10-02 20:31:35,892 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-10-02 20:31:35,892 INFO  L138        SettingsManager]:  * User list type=DISABLED
[2019-10-02 20:31:35,893 INFO  L138        SettingsManager]:  * Ignore calls to and inside polymorphic procedures=false
[2019-10-02 20:31:35,893 INFO  L138        SettingsManager]:  * Ignore calls to recursive procedures=false
[2019-10-02 20:31:35,893 INFO  L136        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-10-02 20:31:35,893 INFO  L138        SettingsManager]:  * Abstract domain=IntervalDomain
[2019-10-02 20:31:35,894 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-02 20:31:35,894 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-10-02 20:31:35,894 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-10-02 20:31:35,894 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-10-02 20:31:35,895 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-10-02 20:31:35,895 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-02 20:31:35,895 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-10-02 20:31:35,895 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-10-02 20:31:35,895 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-10-02 20:31:35,896 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-10-02 20:31:35,896 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-02 20:31:35,896 INFO  L138        SettingsManager]:  * Remove goto edges from RCFG=true
[2019-10-02 20:31:35,896 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-10-02 20:31:35,896 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-02 20:31:35,897 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-02 20:31:35,897 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-10-02 20:31:35,897 INFO  L138        SettingsManager]:  * Trace refinement strategy=TAIPAN
[2019-10-02 20:31:35,897 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-02 20:31:35,897 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-10-02 20:31:35,898 INFO  L138        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
[2019-10-02 20:31:35,931 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-02 20:31:35,945 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-02 20:31:35,950 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-02 20:31:35,951 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-10-02 20:31:35,954 INFO  L275        PluginConnector]: CDTParser initialized
[2019-10-02 20:31:35,955 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19.c
[2019-10-02 20:31:36,021 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d8a681e/df4d9131616a4fd88cc5d1f80a7d4a7d/FLAG1dd47f009
[2019-10-02 20:31:36,616 INFO  L306              CDTParser]: Found 1 translation units.
[2019-10-02 20:31:36,618 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19.c
[2019-10-02 20:31:36,637 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d8a681e/df4d9131616a4fd88cc5d1f80a7d4a7d/FLAG1dd47f009
[2019-10-02 20:31:36,856 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d8a681e/df4d9131616a4fd88cc5d1f80a7d4a7d
[2019-10-02 20:31:36,865 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-02 20:31:36,866 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-02 20:31:36,867 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-02 20:31:36,867 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-02 20:31:36,871 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-02 20:31:36,872 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:31:36" (1/1) ...
[2019-10-02 20:31:36,875 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:36, skipping insertion in model container
[2019-10-02 20:31:36,875 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:31:36" (1/1) ...
[2019-10-02 20:31:36,882 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-10-02 20:31:36,945 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-10-02 20:31:37,468 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-02 20:31:37,473 INFO  L188         MainTranslator]: Completed pre-run
[2019-10-02 20:31:37,682 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-02 20:31:37,705 INFO  L192         MainTranslator]: Completed translation
[2019-10-02 20:31:37,706 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37 WrapperNode
[2019-10-02 20:31:37,706 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-02 20:31:37,707 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-02 20:31:37,707 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-02 20:31:37,708 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-10-02 20:31:37,725 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,725 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,746 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,747 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,797 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,823 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,844 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
[2019-10-02 20:31:37,859 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-02 20:31:37,860 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-02 20:31:37,860 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-10-02 20:31:37,860 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-10-02 20:31:37,861 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-02 20:31:37,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-02 20:31:37,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-02 20:31:37,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure calculate_output
[2019-10-02 20:31:37,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-10-02 20:31:37,959 INFO  L130     BoogieDeclarations]: Found specification of procedure calculate_output
[2019-10-02 20:31:37,959 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-02 20:31:37,959 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-02 20:31:37,961 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2019-10-02 20:31:37,961 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-10-02 20:31:37,961 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-02 20:31:37,962 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-02 20:31:39,731 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-02 20:31:39,732 INFO  L283             CfgBuilder]: Removed 1 assume(true) statements.
[2019-10-02 20:31:39,734 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:31:39 BoogieIcfgContainer
[2019-10-02 20:31:39,734 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-02 20:31:39,736 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-02 20:31:39,737 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-10-02 20:31:39,740 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-10-02 20:31:39,740 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:31:36" (1/3) ...
[2019-10-02 20:31:39,741 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd08d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:31:39, skipping insertion in model container
[2019-10-02 20:31:39,741 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:31:37" (2/3) ...
[2019-10-02 20:31:39,742 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd08d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:31:39, skipping insertion in model container
[2019-10-02 20:31:39,742 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:31:39" (3/3) ...
[2019-10-02 20:31:39,744 INFO  L109   eAbstractionObserver]: Analyzing ICFG Problem14_label19.c
[2019-10-02 20:31:39,755 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-02 20:31:39,766 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-02 20:31:39,783 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-02 20:31:39,821 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-10-02 20:31:39,822 INFO  L378      AbstractCegarLoop]: Hoare is false
[2019-10-02 20:31:39,822 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-02 20:31:39,823 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-02 20:31:39,823 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-02 20:31:39,823 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-10-02 20:31:39,823 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-02 20:31:39,823 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-02 20:31:39,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 254 states.
[2019-10-02 20:31:39,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2019-10-02 20:31:39,881 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:39,883 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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]
[2019-10-02 20:31:39,886 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:39,895 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:39,895 INFO  L82        PathProgramCache]: Analyzing trace with hash -370104541, now seen corresponding path program 1 times
[2019-10-02 20:31:39,898 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:39,959 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:39,959 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:39,959 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:39,960 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:40,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:40,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:40,268 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:40,268 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-02 20:31:40,268 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:40,274 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-02 20:31:40,289 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-02 20:31:40,290 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-02 20:31:40,292 INFO  L87              Difference]: Start difference. First operand 254 states. Second operand 3 states.
[2019-10-02 20:31:41,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:41,578 INFO  L93              Difference]: Finished difference Result 440 states and 718 transitions.
[2019-10-02 20:31:41,578 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-02 20:31:41,580 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 68
[2019-10-02 20:31:41,580 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:41,598 INFO  L225             Difference]: With dead ends: 440
[2019-10-02 20:31:41,598 INFO  L226             Difference]: Without dead ends: 372
[2019-10-02 20:31:41,600 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-02 20:31:41,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2019-10-02 20:31:41,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372.
[2019-10-02 20:31:41,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 372 states.
[2019-10-02 20:31:41,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions.
[2019-10-02 20:31:41,689 INFO  L78                 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 68
[2019-10-02 20:31:41,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:41,690 INFO  L475      AbstractCegarLoop]: Abstraction has 372 states and 602 transitions.
[2019-10-02 20:31:41,690 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-02 20:31:41,690 INFO  L276                IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions.
[2019-10-02 20:31:41,702 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2019-10-02 20:31:41,702 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:41,703 INFO  L411         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1]
[2019-10-02 20:31:41,703 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:41,703 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:41,704 INFO  L82        PathProgramCache]: Analyzing trace with hash -115709203, now seen corresponding path program 1 times
[2019-10-02 20:31:41,704 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:41,706 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:41,707 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:41,707 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:41,707 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:41,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:41,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:41,991 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:41,991 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-02 20:31:41,991 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:41,993 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-02 20:31:41,994 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-02 20:31:41,994 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-10-02 20:31:41,994 INFO  L87              Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states.
[2019-10-02 20:31:43,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:43,330 INFO  L93              Difference]: Finished difference Result 570 states and 887 transitions.
[2019-10-02 20:31:43,332 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-10-02 20:31:43,332 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 137
[2019-10-02 20:31:43,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:43,337 INFO  L225             Difference]: With dead ends: 570
[2019-10-02 20:31:43,337 INFO  L226             Difference]: Without dead ends: 570
[2019-10-02 20:31:43,338 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-10-02 20:31:43,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 570 states.
[2019-10-02 20:31:43,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 564.
[2019-10-02 20:31:43,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 564 states.
[2019-10-02 20:31:43,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 877 transitions.
[2019-10-02 20:31:43,377 INFO  L78                 Accepts]: Start accepts. Automaton has 564 states and 877 transitions. Word has length 137
[2019-10-02 20:31:43,377 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:43,377 INFO  L475      AbstractCegarLoop]: Abstraction has 564 states and 877 transitions.
[2019-10-02 20:31:43,378 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-02 20:31:43,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 564 states and 877 transitions.
[2019-10-02 20:31:43,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2019-10-02 20:31:43,381 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:43,381 INFO  L411         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2019-10-02 20:31:43,382 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:43,382 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:43,382 INFO  L82        PathProgramCache]: Analyzing trace with hash 1811598022, now seen corresponding path program 1 times
[2019-10-02 20:31:43,382 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:43,384 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:43,384 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:43,384 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:43,384 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:43,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:43,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:43,500 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:43,500 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-02 20:31:43,501 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:43,501 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-02 20:31:43,502 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-02 20:31:43,502 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-10-02 20:31:43,502 INFO  L87              Difference]: Start difference. First operand 564 states and 877 transitions. Second operand 5 states.
[2019-10-02 20:31:44,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:44,820 INFO  L93              Difference]: Finished difference Result 1156 states and 1719 transitions.
[2019-10-02 20:31:44,820 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-10-02 20:31:44,820 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 138
[2019-10-02 20:31:44,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:44,828 INFO  L225             Difference]: With dead ends: 1156
[2019-10-02 20:31:44,829 INFO  L226             Difference]: Without dead ends: 1156
[2019-10-02 20:31:44,829 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2019-10-02 20:31:44,831 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1156 states.
[2019-10-02 20:31:44,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1136.
[2019-10-02 20:31:44,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1136 states.
[2019-10-02 20:31:44,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1659 transitions.
[2019-10-02 20:31:44,898 INFO  L78                 Accepts]: Start accepts. Automaton has 1136 states and 1659 transitions. Word has length 138
[2019-10-02 20:31:44,899 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:44,899 INFO  L475      AbstractCegarLoop]: Abstraction has 1136 states and 1659 transitions.
[2019-10-02 20:31:44,899 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-02 20:31:44,899 INFO  L276                IsEmpty]: Start isEmpty. Operand 1136 states and 1659 transitions.
[2019-10-02 20:31:44,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2019-10-02 20:31:44,902 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:44,903 INFO  L411         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:31:44,903 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:44,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:44,904 INFO  L82        PathProgramCache]: Analyzing trace with hash 1374708642, now seen corresponding path program 1 times
[2019-10-02 20:31:44,904 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:44,905 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:44,905 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:44,905 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:44,905 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:44,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:45,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:45,043 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:45,043 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-02 20:31:45,043 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:45,044 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-02 20:31:45,044 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-02 20:31:45,044 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-10-02 20:31:45,045 INFO  L87              Difference]: Start difference. First operand 1136 states and 1659 transitions. Second operand 5 states.
[2019-10-02 20:31:46,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:46,230 INFO  L93              Difference]: Finished difference Result 1748 states and 2450 transitions.
[2019-10-02 20:31:46,231 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-10-02 20:31:46,231 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 140
[2019-10-02 20:31:46,232 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:46,242 INFO  L225             Difference]: With dead ends: 1748
[2019-10-02 20:31:46,242 INFO  L226             Difference]: Without dead ends: 1748
[2019-10-02 20:31:46,243 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2019-10-02 20:31:46,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1748 states.
[2019-10-02 20:31:46,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1520.
[2019-10-02 20:31:46,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1520 states.
[2019-10-02 20:31:46,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2133 transitions.
[2019-10-02 20:31:46,301 INFO  L78                 Accepts]: Start accepts. Automaton has 1520 states and 2133 transitions. Word has length 140
[2019-10-02 20:31:46,301 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:46,302 INFO  L475      AbstractCegarLoop]: Abstraction has 1520 states and 2133 transitions.
[2019-10-02 20:31:46,302 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-02 20:31:46,302 INFO  L276                IsEmpty]: Start isEmpty. Operand 1520 states and 2133 transitions.
[2019-10-02 20:31:46,304 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2019-10-02 20:31:46,305 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:46,305 INFO  L411         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:31:46,305 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:46,306 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:46,306 INFO  L82        PathProgramCache]: Analyzing trace with hash 673073701, now seen corresponding path program 1 times
[2019-10-02 20:31:46,306 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:46,307 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:46,307 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:46,308 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:46,308 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:46,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:46,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:46,515 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:46,515 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-02 20:31:46,515 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:46,516 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-02 20:31:46,516 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-02 20:31:46,516 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-02 20:31:46,517 INFO  L87              Difference]: Start difference. First operand 1520 states and 2133 transitions. Second operand 5 states.
[2019-10-02 20:31:48,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:48,149 INFO  L93              Difference]: Finished difference Result 2512 states and 3333 transitions.
[2019-10-02 20:31:48,149 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-10-02 20:31:48,149 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 141
[2019-10-02 20:31:48,150 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:48,160 INFO  L225             Difference]: With dead ends: 2512
[2019-10-02 20:31:48,160 INFO  L226             Difference]: Without dead ends: 2068
[2019-10-02 20:31:48,161 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2019-10-02 20:31:48,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2068 states.
[2019-10-02 20:31:48,204 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1694.
[2019-10-02 20:31:48,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1694 states.
[2019-10-02 20:31:48,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1968 transitions.
[2019-10-02 20:31:48,211 INFO  L78                 Accepts]: Start accepts. Automaton has 1694 states and 1968 transitions. Word has length 141
[2019-10-02 20:31:48,212 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:48,212 INFO  L475      AbstractCegarLoop]: Abstraction has 1694 states and 1968 transitions.
[2019-10-02 20:31:48,212 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-02 20:31:48,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 1694 states and 1968 transitions.
[2019-10-02 20:31:48,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2019-10-02 20:31:48,217 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:48,217 INFO  L411         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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]
[2019-10-02 20:31:48,217 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:48,217 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:48,218 INFO  L82        PathProgramCache]: Analyzing trace with hash 528451226, now seen corresponding path program 1 times
[2019-10-02 20:31:48,218 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:48,219 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:48,219 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:48,219 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:48,220 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:48,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:48,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:48,376 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-02 20:31:48,377 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-02 20:31:48,377 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:31:48,377 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-02 20:31:48,378 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-02 20:31:48,378 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-02 20:31:48,378 INFO  L87              Difference]: Start difference. First operand 1694 states and 1968 transitions. Second operand 4 states.
[2019-10-02 20:31:49,100 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:31:49,101 INFO  L93              Difference]: Finished difference Result 1876 states and 2161 transitions.
[2019-10-02 20:31:49,104 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-02 20:31:49,105 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 240
[2019-10-02 20:31:49,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:31:49,113 INFO  L225             Difference]: With dead ends: 1876
[2019-10-02 20:31:49,113 INFO  L226             Difference]: Without dead ends: 1876
[2019-10-02 20:31:49,114 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-10-02 20:31:49,116 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1876 states.
[2019-10-02 20:31:49,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876.
[2019-10-02 20:31:49,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1876 states.
[2019-10-02 20:31:49,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2161 transitions.
[2019-10-02 20:31:49,156 INFO  L78                 Accepts]: Start accepts. Automaton has 1876 states and 2161 transitions. Word has length 240
[2019-10-02 20:31:49,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:31:49,157 INFO  L475      AbstractCegarLoop]: Abstraction has 1876 states and 2161 transitions.
[2019-10-02 20:31:49,157 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-02 20:31:49,157 INFO  L276                IsEmpty]: Start isEmpty. Operand 1876 states and 2161 transitions.
[2019-10-02 20:31:49,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2019-10-02 20:31:49,163 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:31:49,164 INFO  L411         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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]
[2019-10-02 20:31:49,164 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:31:49,164 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:49,165 INFO  L82        PathProgramCache]: Analyzing trace with hash -1924779938, now seen corresponding path program 1 times
[2019-10-02 20:31:49,165 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:31:49,166 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:49,166 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:31:49,166 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:31:49,167 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:31:49,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:31:50,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-02 20:31:50,194 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:31:50,194 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:31:50,195 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: 
[2019-10-02 20:31:50,197 INFO  L207      CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:31:50,254 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:31:50,258 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:31:59,387 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:31:59,389 INFO  L272    AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Performed 273 root evaluator evaluations with a maximum evaluation depth of 13. Performed 273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables.
[2019-10-02 20:31:59,393 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:31:59,394 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:32:08,345 INFO  L227   lantSequenceWeakener]: Weakened 262 states. On average, predicates are now at 78.25% of their original sizes.
[2019-10-02 20:32:08,345 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:32:08,451 INFO  L420   sIntCurrentIteration]: We unified 280 AI predicates to 280
[2019-10-02 20:32:08,451 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:32:08,452 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:32:08,452 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19
[2019-10-02 20:32:08,453 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:32:08,453 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-02 20:32:08,453 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-02 20:32:08,454 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2019-10-02 20:32:08,454 INFO  L87              Difference]: Start difference. First operand 1876 states and 2161 transitions. Second operand 11 states.
[2019-10-02 20:34:02,208 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:34:55,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:34:55,620 INFO  L93              Difference]: Finished difference Result 2062 states and 2351 transitions.
[2019-10-02 20:34:55,621 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-10-02 20:34:55,621 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 281
[2019-10-02 20:34:55,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:34:55,629 INFO  L225             Difference]: With dead ends: 2062
[2019-10-02 20:34:55,629 INFO  L226             Difference]: Without dead ends: 2062
[2019-10-02 20:34:55,630 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240
[2019-10-02 20:34:55,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2062 states.
[2019-10-02 20:34:55,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2058.
[2019-10-02 20:34:55,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2058 states.
[2019-10-02 20:34:55,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2345 transitions.
[2019-10-02 20:34:55,671 INFO  L78                 Accepts]: Start accepts. Automaton has 2058 states and 2345 transitions. Word has length 281
[2019-10-02 20:34:55,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:34:55,672 INFO  L475      AbstractCegarLoop]: Abstraction has 2058 states and 2345 transitions.
[2019-10-02 20:34:55,672 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-02 20:34:55,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 2058 states and 2345 transitions.
[2019-10-02 20:34:55,680 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 392
[2019-10-02 20:34:55,680 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:34:55,681 INFO  L411         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:34:55,681 INFO  L418      AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:34:55,682 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:34:55,682 INFO  L82        PathProgramCache]: Analyzing trace with hash 1610573163, now seen corresponding path program 1 times
[2019-10-02 20:34:55,682 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:34:55,683 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:34:55,684 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:34:55,684 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:34:55,684 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:34:55,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:34:56,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 495 backedges. 240 proven. 202 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2019-10-02 20:34:56,447 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:34:56,448 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:34:56,448 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 392 with the following transitions: 
[2019-10-02 20:34:56,449 INFO  L207      CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:34:56,469 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:34:56,469 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:35:11,246 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:35:11,248 INFO  L272    AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 565 root evaluator evaluations with a maximum evaluation depth of 13. Performed 565 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables.
[2019-10-02 20:35:11,248 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:35:11,248 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:35:24,488 INFO  L227   lantSequenceWeakener]: Weakened 388 states. On average, predicates are now at 77.87% of their original sizes.
[2019-10-02 20:35:24,488 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:35:24,571 INFO  L420   sIntCurrentIteration]: We unified 390 AI predicates to 390
[2019-10-02 20:35:24,572 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:35:24,572 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:35:24,572 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17
[2019-10-02 20:35:24,572 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:35:24,574 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 11 states
[2019-10-02 20:35:24,574 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2019-10-02 20:35:24,574 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2019-10-02 20:35:24,575 INFO  L87              Difference]: Start difference. First operand 2058 states and 2345 transitions. Second operand 11 states.
[2019-10-02 20:36:05,401 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:38:08,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:38:08,317 INFO  L93              Difference]: Finished difference Result 2244 states and 2534 transitions.
[2019-10-02 20:38:08,317 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2019-10-02 20:38:08,317 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 391
[2019-10-02 20:38:08,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:38:08,333 INFO  L225             Difference]: With dead ends: 2244
[2019-10-02 20:38:08,333 INFO  L226             Difference]: Without dead ends: 2244
[2019-10-02 20:38:08,335 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342
[2019-10-02 20:38:08,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2244 states.
[2019-10-02 20:38:08,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2242.
[2019-10-02 20:38:08,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2242 states.
[2019-10-02 20:38:08,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 2532 transitions.
[2019-10-02 20:38:08,402 INFO  L78                 Accepts]: Start accepts. Automaton has 2242 states and 2532 transitions. Word has length 391
[2019-10-02 20:38:08,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:38:08,403 INFO  L475      AbstractCegarLoop]: Abstraction has 2242 states and 2532 transitions.
[2019-10-02 20:38:08,403 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2019-10-02 20:38:08,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 2242 states and 2532 transitions.
[2019-10-02 20:38:08,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 501
[2019-10-02 20:38:08,419 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:38:08,420 INFO  L411         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:38:08,420 INFO  L418      AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:38:08,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:38:08,421 INFO  L82        PathProgramCache]: Analyzing trace with hash 740567223, now seen corresponding path program 1 times
[2019-10-02 20:38:08,421 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:38:08,423 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:38:08,424 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:38:08,424 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:38:08,424 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:38:08,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:38:09,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 875 backedges. 551 proven. 2 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked.
[2019-10-02 20:38:09,929 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:38:09,929 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:38:09,930 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 501 with the following transitions: 
[2019-10-02 20:38:09,930 INFO  L207      CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:38:09,935 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:38:09,935 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:38:23,339 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:38:50,387 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:38:50,388 INFO  L272    AbstractInterpreter]: Visited 122 different actions 593 times. Merged at 6 different actions 23 times. Never widened. Performed 1161 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1161 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 5 fixpoints after 1 different actions. Largest state had 24 variables.
[2019-10-02 20:38:50,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:38:50,388 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:39:01,291 INFO  L227   lantSequenceWeakener]: Weakened 497 states. On average, predicates are now at 77.75% of their original sizes.
[2019-10-02 20:39:01,291 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:39:01,354 INFO  L420   sIntCurrentIteration]: We unified 499 AI predicates to 499
[2019-10-02 20:39:01,354 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:39:01,354 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:39:01,354 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19
[2019-10-02 20:39:01,354 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:39:01,355 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-02 20:39:01,355 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-02 20:39:01,356 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2019-10-02 20:39:01,356 INFO  L87              Difference]: Start difference. First operand 2242 states and 2532 transitions. Second operand 10 states.
[2019-10-02 20:42:26,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-02 20:42:26,559 INFO  L93              Difference]: Finished difference Result 2619 states and 2922 transitions.
[2019-10-02 20:42:26,559 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2019-10-02 20:42:26,559 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 500
[2019-10-02 20:42:26,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-02 20:42:26,571 INFO  L225             Difference]: With dead ends: 2619
[2019-10-02 20:42:26,571 INFO  L226             Difference]: Without dead ends: 2619
[2019-10-02 20:42:26,572 INFO  L640         BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306
[2019-10-02 20:42:26,575 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2619 states.
[2019-10-02 20:42:26,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2614.
[2019-10-02 20:42:26,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2614 states.
[2019-10-02 20:42:26,626 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 2917 transitions.
[2019-10-02 20:42:26,627 INFO  L78                 Accepts]: Start accepts. Automaton has 2614 states and 2917 transitions. Word has length 500
[2019-10-02 20:42:26,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-02 20:42:26,628 INFO  L475      AbstractCegarLoop]: Abstraction has 2614 states and 2917 transitions.
[2019-10-02 20:42:26,628 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-10-02 20:42:26,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 2614 states and 2917 transitions.
[2019-10-02 20:42:26,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 678
[2019-10-02 20:42:26,648 INFO  L403         BasicCegarLoop]: Found error trace
[2019-10-02 20:42:26,648 INFO  L411         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-02 20:42:26,649 INFO  L418      AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-02 20:42:26,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:42:26,649 INFO  L82        PathProgramCache]: Analyzing trace with hash -523694669, now seen corresponding path program 1 times
[2019-10-02 20:42:26,649 INFO  L69    tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-10-02 20:42:26,650 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:42:26,651 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-02 20:42:26,651 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-02 20:42:26,651 INFO  L289   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-10-02 20:42:26,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-02 20:42:27,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 1368 backedges. 541 proven. 211 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked.
[2019-10-02 20:42:27,700 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-10-02 20:42:27,700 INFO  L193   anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-10-02 20:42:27,701 INFO  L205      CegarAbsIntRunner]: Running AI on error trace of length 678 with the following transitions: 
[2019-10-02 20:42:27,701 INFO  L207      CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [926], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977]
[2019-10-02 20:42:27,706 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-02 20:42:27,706 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-02 20:42:53,209 WARN  L79         EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.
[2019-10-02 20:44:08,192 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-02 20:44:08,192 INFO  L272    AbstractInterpreter]: Visited 188 different actions 930 times. Merged at 7 different actions 30 times. Never widened. Performed 1529 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1529 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 8 fixpoints after 2 different actions. Largest state had 24 variables.
[2019-10-02 20:44:08,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-02 20:44:08,193 INFO  L403   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-02 20:44:27,676 INFO  L227   lantSequenceWeakener]: Weakened 674 states. On average, predicates are now at 77.64% of their original sizes.
[2019-10-02 20:44:27,676 INFO  L418   sIntCurrentIteration]: Unifying AI predicates
[2019-10-02 20:44:27,751 INFO  L420   sIntCurrentIteration]: We unified 676 AI predicates to 676
[2019-10-02 20:44:27,752 INFO  L429   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-02 20:44:27,752 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2019-10-02 20:44:27,752 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15
[2019-10-02 20:44:27,752 INFO  L257   anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-10-02 20:44:27,753 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-10-02 20:44:27,753 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-10-02 20:44:27,753 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2019-10-02 20:44:27,754 INFO  L87              Difference]: Start difference. First operand 2614 states and 2917 transitions. Second operand 10 states.