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/eca-rers2012/Problem03_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:09:50,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:09:50,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:09:50,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:09:50,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:09:50,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:09:50,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:09:50,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:09:50,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:09:50,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:09:50,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:09:50,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:09:50,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:09:50,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:09:50,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:09:50,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:09:50,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:09:50,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:09:50,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:09:50,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:09:50,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:09:50,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:09:50,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:09:50,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:09:50,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:09:50,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:09:50,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:09:50,809 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:09:50,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:09:50,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:09:50,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:09:50,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:09:50,813 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:09:50,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:09:50,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:09:50,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:09:50,816 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 00:09:50,848 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:09:50,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:09:50,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:09:50,849 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:09:50,849 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:09:50,850 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:09:50,850 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:09:50,850 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:09:50,851 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:09:50,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:09:50,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:09:50,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:09:50,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:09:50,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:09:50,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:09:50,854 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:09:50,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:09:50,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:09:50,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:09:50,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:09:50,855 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:09:50,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:09:50,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:09:50,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:09:50,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:09:50,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:09:50,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:09:50,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:09:50,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:09:50,858 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:09:50,858 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:09:50,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:09:50,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:09:50,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:09:50,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:09:50,935 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:09:50,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-25 00:09:50,986 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/713306398/778c28ad03fa42e094ab8fcb879e67a0/FLAG357ab4a88 [2018-10-25 00:09:51,652 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:09:51,653 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label11_true-unreach-call.c [2018-10-25 00:09:51,671 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/713306398/778c28ad03fa42e094ab8fcb879e67a0/FLAG357ab4a88 [2018-10-25 00:09:51,692 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/713306398/778c28ad03fa42e094ab8fcb879e67a0 [2018-10-25 00:09:51,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:09:51,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:09:51,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:09:51,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:09:51,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:09:51,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:09:51" (1/1) ... [2018-10-25 00:09:51,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639b200f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:51, skipping insertion in model container [2018-10-25 00:09:51,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:09:51" (1/1) ... [2018-10-25 00:09:51,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:09:51,831 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:09:52,644 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:09:52,650 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:09:52,990 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:09:53,015 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:09:53,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53 WrapperNode [2018-10-25 00:09:53,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:09:53,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:09:53,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:09:53,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:09:53,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:09:53,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:09:53,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:09:53,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:09:53,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (1/1) ... [2018-10-25 00:09:53,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:09:53,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:09:53,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:09:53,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:09:53,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (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 00:09:53,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:09:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:09:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:09:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:09:53,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:09:53,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:09:53,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:09:53,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:09:58,625 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:09:58,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:09:58 BoogieIcfgContainer [2018-10-25 00:09:58,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:09:58,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:09:58,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:09:58,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:09:58,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:09:51" (1/3) ... [2018-10-25 00:09:58,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555db1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:09:58, skipping insertion in model container [2018-10-25 00:09:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:09:53" (2/3) ... [2018-10-25 00:09:58,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555db1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:09:58, skipping insertion in model container [2018-10-25 00:09:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:09:58" (3/3) ... [2018-10-25 00:09:58,635 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label11_true-unreach-call.c [2018-10-25 00:09:58,646 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:09:58,657 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:09:58,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:09:58,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:09:58,717 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:09:58,718 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:09:58,718 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:09:58,718 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:09:58,718 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:09:58,718 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:09:58,719 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:09:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-25 00:09:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-25 00:09:58,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:09:58,777 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:09:58,780 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:09:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:09:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1813715753, now seen corresponding path program 1 times [2018-10-25 00:09:58,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:09:58,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:58,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:09:58,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:09:58,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:09:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:09:59,750 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:09:59,992 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 00:09:59,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:09:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:09:59,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:00,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:10:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:10:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:10:00,027 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-10-25 00:10:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:02,181 INFO L93 Difference]: Finished difference Result 855 states and 1508 transitions. [2018-10-25 00:10:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:10:02,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-25 00:10:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:02,209 INFO L225 Difference]: With dead ends: 855 [2018-10-25 00:10:02,209 INFO L226 Difference]: Without dead ends: 541 [2018-10-25 00:10:02,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:10:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-25 00:10:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 527. [2018-10-25 00:10:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-25 00:10:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 901 transitions. [2018-10-25 00:10:02,315 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 901 transitions. Word has length 200 [2018-10-25 00:10:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:02,317 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 901 transitions. [2018-10-25 00:10:02,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:10:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 901 transitions. [2018-10-25 00:10:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-25 00:10:02,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:02,327 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:02,327 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:02,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 86742928, now seen corresponding path program 1 times [2018-10-25 00:10:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:02,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:02,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:02,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:02,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:10:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:10:02,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:02,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:10:02,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:10:02,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:10:02,751 INFO L87 Difference]: Start difference. First operand 527 states and 901 transitions. Second operand 6 states. [2018-10-25 00:10:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:07,245 INFO L93 Difference]: Finished difference Result 1590 states and 2790 transitions. [2018-10-25 00:10:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:10:07,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-10-25 00:10:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:07,264 INFO L225 Difference]: With dead ends: 1590 [2018-10-25 00:10:07,265 INFO L226 Difference]: Without dead ends: 1069 [2018-10-25 00:10:07,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:10:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-25 00:10:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-10-25 00:10:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-25 00:10:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1744 transitions. [2018-10-25 00:10:07,357 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1744 transitions. Word has length 210 [2018-10-25 00:10:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:07,358 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1744 transitions. [2018-10-25 00:10:07,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:10:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1744 transitions. [2018-10-25 00:10:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 00:10:07,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:07,368 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:07,368 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:07,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1017484904, now seen corresponding path program 1 times [2018-10-25 00:10:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:07,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:07,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:07,673 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:10:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:07,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:10:07,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:10:07,892 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:07,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:10:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:10:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:10:07,894 INFO L87 Difference]: Start difference. First operand 1024 states and 1744 transitions. Second operand 5 states. [2018-10-25 00:10:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:11,444 INFO L93 Difference]: Finished difference Result 3166 states and 5668 transitions. [2018-10-25 00:10:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:10:11,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2018-10-25 00:10:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:11,474 INFO L225 Difference]: With dead ends: 3166 [2018-10-25 00:10:11,475 INFO L226 Difference]: Without dead ends: 2148 [2018-10-25 00:10:11,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:10:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-10-25 00:10:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-10-25 00:10:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-10-25 00:10:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3420 transitions. [2018-10-25 00:10:11,568 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3420 transitions. Word has length 211 [2018-10-25 00:10:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:11,568 INFO L481 AbstractCegarLoop]: Abstraction has 2105 states and 3420 transitions. [2018-10-25 00:10:11,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:10:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3420 transitions. [2018-10-25 00:10:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-25 00:10:11,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:11,579 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:11,579 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:11,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1009483949, now seen corresponding path program 1 times [2018-10-25 00:10:11,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:11,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:11,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:11,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:10:11,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:10:11,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:11,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:10:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:10:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:10:11,994 INFO L87 Difference]: Start difference. First operand 2105 states and 3420 transitions. Second operand 3 states. [2018-10-25 00:10:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:13,308 INFO L93 Difference]: Finished difference Result 6093 states and 10292 transitions. [2018-10-25 00:10:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:10:13,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-25 00:10:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:13,335 INFO L225 Difference]: With dead ends: 6093 [2018-10-25 00:10:13,336 INFO L226 Difference]: Without dead ends: 3994 [2018-10-25 00:10:13,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 00:10:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2018-10-25 00:10:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3991. [2018-10-25 00:10:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3991 states. [2018-10-25 00:10:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 6333 transitions. [2018-10-25 00:10:13,467 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 6333 transitions. Word has length 213 [2018-10-25 00:10:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:13,467 INFO L481 AbstractCegarLoop]: Abstraction has 3991 states and 6333 transitions. [2018-10-25 00:10:13,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:10:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 6333 transitions. [2018-10-25 00:10:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:10:13,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:13,485 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:13,485 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:13,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 535960129, now seen corresponding path program 1 times [2018-10-25 00:10:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:13,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:13,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:10:13,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 00:10:13,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:13,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:10:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:10:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:10:13,990 INFO L87 Difference]: Start difference. First operand 3991 states and 6333 transitions. Second operand 7 states. [2018-10-25 00:10:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:16,589 INFO L93 Difference]: Finished difference Result 12139 states and 21255 transitions. [2018-10-25 00:10:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:10:16,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 219 [2018-10-25 00:10:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:16,656 INFO L225 Difference]: With dead ends: 12139 [2018-10-25 00:10:16,657 INFO L226 Difference]: Without dead ends: 8154 [2018-10-25 00:10:16,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:10:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states. [2018-10-25 00:10:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 7966. [2018-10-25 00:10:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2018-10-25 00:10:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 13096 transitions. [2018-10-25 00:10:16,970 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 13096 transitions. Word has length 219 [2018-10-25 00:10:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:16,970 INFO L481 AbstractCegarLoop]: Abstraction has 7966 states and 13096 transitions. [2018-10-25 00:10:16,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:10:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 13096 transitions. [2018-10-25 00:10:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-25 00:10:16,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:16,999 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:17,000 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:17,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash 486898844, now seen corresponding path program 1 times [2018-10-25 00:10:17,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:17,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:17,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:17,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:17,238 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:10:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:17,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:10:17,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:10:17,350 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:17,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:10:17,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:10:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:10:17,351 INFO L87 Difference]: Start difference. First operand 7966 states and 13096 transitions. Second operand 6 states. [2018-10-25 00:10:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:10:19,615 INFO L93 Difference]: Finished difference Result 16547 states and 28268 transitions. [2018-10-25 00:10:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:10:19,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2018-10-25 00:10:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:10:19,677 INFO L225 Difference]: With dead ends: 16547 [2018-10-25 00:10:19,677 INFO L226 Difference]: Without dead ends: 8587 [2018-10-25 00:10:19,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:10:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2018-10-25 00:10:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 8357. [2018-10-25 00:10:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8357 states. [2018-10-25 00:10:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8357 states to 8357 states and 12585 transitions. [2018-10-25 00:10:19,980 INFO L78 Accepts]: Start accepts. Automaton has 8357 states and 12585 transitions. Word has length 220 [2018-10-25 00:10:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:10:19,980 INFO L481 AbstractCegarLoop]: Abstraction has 8357 states and 12585 transitions. [2018-10-25 00:10:19,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:10:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states and 12585 transitions. [2018-10-25 00:10:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-25 00:10:20,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:10:20,001 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:10:20,002 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:10:20,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1745842198, now seen corresponding path program 1 times [2018-10-25 00:10:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:10:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:20,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:10:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:10:20,004 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:10:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:10:20,245 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:10:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:10:20,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:10:20,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:10:20,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-10-25 00:10:20,470 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [10], [12], [13], [17], [21], [25], [28], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1061], [1063], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:10:20,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:10:20,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:10:21,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:10:21,702 INFO L272 AbstractInterpreter]: Visited 201 different actions 201 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-10-25 00:10:21,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:10:21,738 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:10:22,843 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 74.51% of their original sizes. [2018-10-25 00:10:22,843 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:10:23,232 INFO L413 sIntCurrentIteration]: We have 223 unified AI predicates [2018-10-25 00:10:23,232 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:10:23,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:10:23,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-10-25 00:10:23,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:10:23,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-25 00:10:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-25 00:10:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:10:23,235 INFO L87 Difference]: Start difference. First operand 8357 states and 12585 transitions. Second operand 17 states. [2018-10-25 00:12:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:12:02,351 INFO L93 Difference]: Finished difference Result 16918 states and 25465 transitions. [2018-10-25 00:12:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:12:02,351 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 224 [2018-10-25 00:12:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:12:02,381 INFO L225 Difference]: With dead ends: 16918 [2018-10-25 00:12:02,381 INFO L226 Difference]: Without dead ends: 8567 [2018-10-25 00:12:02,404 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:12:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2018-10-25 00:12:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8565. [2018-10-25 00:12:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8565 states. [2018-10-25 00:12:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8565 states to 8565 states and 12804 transitions. [2018-10-25 00:12:02,631 INFO L78 Accepts]: Start accepts. Automaton has 8565 states and 12804 transitions. Word has length 224 [2018-10-25 00:12:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:12:02,632 INFO L481 AbstractCegarLoop]: Abstraction has 8565 states and 12804 transitions. [2018-10-25 00:12:02,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-25 00:12:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8565 states and 12804 transitions. [2018-10-25 00:12:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-25 00:12:02,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:12:02,653 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:02,654 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:12:02,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash 361647275, now seen corresponding path program 1 times [2018-10-25 00:12:02,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:12:02,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:02,657 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:12:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:12:02,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:02,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:12:02,978 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-10-25 00:12:02,978 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [10], [12], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1061], [1063], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:12:03,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:12:03,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:12:05,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:12:05,634 INFO L272 AbstractInterpreter]: Visited 206 different actions 403 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:12:05,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:05,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:12:05,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:05,643 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 00:12:05,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:05,655 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:12:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:05,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:12:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:12:05,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:12:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:12:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:12:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 7 [2018-10-25 00:12:06,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:12:06,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:12:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:12:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:12:06,325 INFO L87 Difference]: Start difference. First operand 8565 states and 12804 transitions. Second operand 3 states. [2018-10-25 00:12:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:12:07,227 INFO L93 Difference]: Finished difference Result 16910 states and 25379 transitions. [2018-10-25 00:12:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:12:07,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-25 00:12:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:12:07,259 INFO L225 Difference]: With dead ends: 16910 [2018-10-25 00:12:07,259 INFO L226 Difference]: Without dead ends: 8559 [2018-10-25 00:12:07,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:12:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8559 states. [2018-10-25 00:12:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8559 to 8559. [2018-10-25 00:12:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8559 states. [2018-10-25 00:12:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8559 states to 8559 states and 12790 transitions. [2018-10-25 00:12:07,487 INFO L78 Accepts]: Start accepts. Automaton has 8559 states and 12790 transitions. Word has length 233 [2018-10-25 00:12:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:12:07,488 INFO L481 AbstractCegarLoop]: Abstraction has 8559 states and 12790 transitions. [2018-10-25 00:12:07,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:12:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 8559 states and 12790 transitions. [2018-10-25 00:12:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 00:12:07,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:12:07,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:07,512 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:12:07,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 151483179, now seen corresponding path program 1 times [2018-10-25 00:12:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:12:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:07,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:07,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:12:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:12:07,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:07,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:12:07,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-10-25 00:12:07,990 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [56], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1061], [1063], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:12:08,000 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:12:08,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:12:12,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:12:12,605 INFO L272 AbstractInterpreter]: Visited 205 different actions 617 times. Merged at 7 different actions 25 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:12:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:12,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:12:12,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:12,611 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 00:12:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:12,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:12:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:12,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:12:13,183 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-10-25 00:12:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:12:13,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:12:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:12:13,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:12:13,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-10-25 00:12:13,874 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:12:13,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:12:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:12:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:12:13,876 INFO L87 Difference]: Start difference. First operand 8559 states and 12790 transitions. Second operand 9 states. [2018-10-25 00:12:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:12:29,766 INFO L93 Difference]: Finished difference Result 69437 states and 145114 transitions. [2018-10-25 00:12:29,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-25 00:12:29,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2018-10-25 00:12:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:12:30,264 INFO L225 Difference]: With dead ends: 69437 [2018-10-25 00:12:30,264 INFO L226 Difference]: Without dead ends: 61092 [2018-10-25 00:12:30,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2018-10-25 00:12:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61092 states. [2018-10-25 00:12:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61092 to 57774. [2018-10-25 00:12:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57774 states. [2018-10-25 00:12:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57774 states to 57774 states and 83421 transitions. [2018-10-25 00:12:33,720 INFO L78 Accepts]: Start accepts. Automaton has 57774 states and 83421 transitions. Word has length 242 [2018-10-25 00:12:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:12:33,720 INFO L481 AbstractCegarLoop]: Abstraction has 57774 states and 83421 transitions. [2018-10-25 00:12:33,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:12:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 57774 states and 83421 transitions. [2018-10-25 00:12:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-25 00:12:33,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:12:33,851 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:33,852 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:12:33,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 646330303, now seen corresponding path program 1 times [2018-10-25 00:12:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:12:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:33,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:33,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:33,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:12:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:12:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:34,440 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:12:34,440 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-10-25 00:12:34,441 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [147], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1061], [1063], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:12:34,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:12:34,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:12:36,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:12:36,936 INFO L272 AbstractInterpreter]: Visited 205 different actions 402 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:12:36,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:36,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:12:36,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:36,945 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 00:12:36,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:36,955 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:12:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:37,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:12:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-25 00:12:37,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:12:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-25 00:12:38,164 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:12:38,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-10-25 00:12:38,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:12:38,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:12:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:12:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:12:38,167 INFO L87 Difference]: Start difference. First operand 57774 states and 83421 transitions. Second operand 3 states. [2018-10-25 00:12:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:12:40,410 INFO L93 Difference]: Finished difference Result 113406 states and 162250 transitions. [2018-10-25 00:12:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:12:40,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2018-10-25 00:12:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:12:40,712 INFO L225 Difference]: With dead ends: 113406 [2018-10-25 00:12:40,712 INFO L226 Difference]: Without dead ends: 69117 [2018-10-25 00:12:40,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:12:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69117 states. [2018-10-25 00:12:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69117 to 68234. [2018-10-25 00:12:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68234 states. [2018-10-25 00:12:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68234 states to 68234 states and 98472 transitions. [2018-10-25 00:12:42,315 INFO L78 Accepts]: Start accepts. Automaton has 68234 states and 98472 transitions. Word has length 263 [2018-10-25 00:12:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:12:42,316 INFO L481 AbstractCegarLoop]: Abstraction has 68234 states and 98472 transitions. [2018-10-25 00:12:42,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:12:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 68234 states and 98472 transitions. [2018-10-25 00:12:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-25 00:12:42,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:12:42,420 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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 00:12:42,420 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:12:42,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1580401863, now seen corresponding path program 1 times [2018-10-25 00:12:42,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:12:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:42,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:12:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:12:42,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:12:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:12:42,729 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:12:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:12:43,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:12:43,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:12:43,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-10-25 00:12:43,228 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [260], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1061], [1063], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:12:43,235 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:12:43,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:12:44,635 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:12:44,635 INFO L272 AbstractInterpreter]: Visited 204 different actions 402 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:12:44,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:12:44,673 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:12:47,272 INFO L232 lantSequenceWeakener]: Weakened 273 states. On average, predicates are now at 73.53% of their original sizes. [2018-10-25 00:12:47,272 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:12:47,658 INFO L413 sIntCurrentIteration]: We have 275 unified AI predicates [2018-10-25 00:12:47,658 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:12:47,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:12:47,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-10-25 00:12:47,659 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:12:47,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-25 00:12:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-25 00:12:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:12:47,660 INFO L87 Difference]: Start difference. First operand 68234 states and 98472 transitions. Second operand 20 states. Received shutdown request... [2018-10-25 00:13:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:13:43,226 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 00:13:43,232 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 00:13:43,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:13:43 BoogieIcfgContainer [2018-10-25 00:13:43,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:13:43,234 INFO L168 Benchmark]: Toolchain (without parser) took 231528.00 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 784.3 MB in the end (delta: 637.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,235 INFO L168 Benchmark]: CDTParser took 0.18 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 00:13:43,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1308.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 324.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.5 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,237 INFO L168 Benchmark]: Boogie Preprocessor took 141.89 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,238 INFO L168 Benchmark]: RCFGBuilder took 5142.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,239 INFO L168 Benchmark]: TraceAbstraction took 224605.88 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 784.3 MB in the end (delta: 1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-10-25 00:13:43,244 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.18 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 1308.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 324.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 768.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -881.5 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.89 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5142.15 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224605.88 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 784.3 MB in the end (delta: 1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1614]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1614). Cancelled while BasicCegarLoop was constructing difference of abstraction (68234states) and FLOYD_HOARE automaton (currently 12 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (12502 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 224.5s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 191.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2553 SDtfs, 11852 SDslu, 2935 SDs, 0 SdLazy, 23414 SolverSat, 2996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 151.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2102 GetRequests, 1975 SyntacticMatches, 6 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68234occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.5s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9992728397658847 AbsIntWeakeningRatio, 0.25301204819277107 AbsIntAvgWeakeningVarsNumRemoved, 27.572289156626507 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 4726 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 3249 NumberOfCodeBlocks, 3249 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3970 ConstructedInterpolants, 0 QuantifiedInterpolants, 1689146 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3207 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 653/670 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown