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_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:13:40,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:13:40,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:13:40,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:13:40,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:13:40,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:13:40,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:13:40,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:13:40,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:13:40,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:13:40,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:13:40,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:13:40,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:13:40,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:13:40,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:13:40,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:13:40,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:13:40,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:13:40,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:13:40,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:13:40,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:13:40,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:13:40,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:13:40,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:13:40,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:13:40,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:13:40,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:13:40,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:13:40,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:13:40,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:13:40,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:13:40,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:13:40,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:13:40,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:13:40,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:13:40,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:13:40,991 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:13:41,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:13:41,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:13:41,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:13:41,022 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:13:41,023 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:13:41,023 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:13:41,023 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:13:41,023 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:13:41,023 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:13:41,024 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:13:41,024 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:13:41,024 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:13:41,024 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:13:41,024 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:13:41,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:13:41,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:13:41,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:13:41,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:13:41,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:13:41,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:13:41,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:13:41,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:13:41,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:13:41,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:13:41,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:13:41,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:13:41,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:13:41,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:13:41,030 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:13:41,030 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:13:41,030 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:13:41,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:13:41,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:13:41,031 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:13:41,031 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:13:41,032 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:13:41,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:13:41,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:13:41,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:13:41,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:13:41,115 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:13:41,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-10-25 00:13:41,187 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5eeaaae6/9974b2fbc2bf4d66b1fa25a0177bb8fb/FLAGb2561c160 [2018-10-25 00:13:41,923 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:13:41,924 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-10-25 00:13:41,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5eeaaae6/9974b2fbc2bf4d66b1fa25a0177bb8fb/FLAGb2561c160 [2018-10-25 00:13:41,965 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d5eeaaae6/9974b2fbc2bf4d66b1fa25a0177bb8fb [2018-10-25 00:13:41,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:13:41,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:13:41,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:41,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:13:41,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:13:41,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:41" (1/1) ... [2018-10-25 00:13:41,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63879a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:41, skipping insertion in model container [2018-10-25 00:13:41,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:41" (1/1) ... [2018-10-25 00:13:41,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:13:42,092 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:13:42,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:42,873 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:13:43,114 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:43,154 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:13:43,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43 WrapperNode [2018-10-25 00:13:43,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:43,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:13:43,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:13:43,157 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:13:43,167 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:13:43" (1/1) ... [2018-10-25 00:13:43,229 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:13:43" (1/1) ... [2018-10-25 00:13:43,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:13:43,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:13:43,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:13:43,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:13:43,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (1/1) ... [2018-10-25 00:13:43,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:13:43,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:13:43,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:13:43,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:13:43,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (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:13:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:13:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:13:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:13:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:13:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:13:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:13:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:13:43,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:13:48,777 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:13:48,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:13:48 BoogieIcfgContainer [2018-10-25 00:13:48,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:13:48,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:13:48,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:13:48,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:13:48,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:13:41" (1/3) ... [2018-10-25 00:13:48,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fcc1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:13:48, skipping insertion in model container [2018-10-25 00:13:48,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:43" (2/3) ... [2018-10-25 00:13:48,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fcc1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:13:48, skipping insertion in model container [2018-10-25 00:13:48,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:13:48" (3/3) ... [2018-10-25 00:13:48,787 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label25_true-unreach-call.c [2018-10-25 00:13:48,797 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:13:48,807 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:13:48,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:13:48,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:13:48,869 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:13:48,869 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:13:48,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:13:48,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:13:48,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:13:48,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:13:48,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:13:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-25 00:13:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-25 00:13:48,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:48,924 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] [2018-10-25 00:13:48,927 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:48,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1441765812, now seen corresponding path program 1 times [2018-10-25 00:13:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:48,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:48,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:50,154 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:13:50,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:50,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:13:50,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:50,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:13:50,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:13:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:13:50,188 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-10-25 00:13:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:53,572 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-10-25 00:13:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:13:53,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-25 00:13:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:53,602 INFO L225 Difference]: With dead ends: 1066 [2018-10-25 00:13:53,603 INFO L226 Difference]: Without dead ends: 748 [2018-10-25 00:13:53,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:13:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-25 00:13:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-10-25 00:13:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-25 00:13:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-10-25 00:13:53,717 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 187 [2018-10-25 00:13:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:53,718 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-10-25 00:13:53,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:13:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-10-25 00:13:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-25 00:13:53,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:53,727 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] [2018-10-25 00:13:53,728 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:53,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash 730517125, now seen corresponding path program 1 times [2018-10-25 00:13:53,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:53,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:54,041 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:13:54,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:54,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:13:54,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:54,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:13:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:13:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:13:54,047 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-10-25 00:13:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:57,275 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-10-25 00:13:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:13:57,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-10-25 00:13:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:57,299 INFO L225 Difference]: With dead ends: 1590 [2018-10-25 00:13:57,299 INFO L226 Difference]: Without dead ends: 1069 [2018-10-25 00:13:57,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:13:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-25 00:13:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-10-25 00:13:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-25 00:13:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-10-25 00:13:57,374 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 197 [2018-10-25 00:13:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:57,374 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-10-25 00:13:57,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:13:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-10-25 00:13:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-25 00:13:57,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:57,380 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] [2018-10-25 00:13:57,381 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:57,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:57,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1518817149, now seen corresponding path program 1 times [2018-10-25 00:13:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:57,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:57,383 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:57,663 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:13:57,900 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:13:57,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:57,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:13:57,901 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:57,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:13:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:13:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:13:57,906 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-10-25 00:14:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:01,451 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-10-25 00:14:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:14:01,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2018-10-25 00:14:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:01,481 INFO L225 Difference]: With dead ends: 3166 [2018-10-25 00:14:01,481 INFO L226 Difference]: Without dead ends: 2148 [2018-10-25 00:14:01,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:14:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-10-25 00:14:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-10-25 00:14:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-10-25 00:14:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-10-25 00:14:01,592 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 198 [2018-10-25 00:14:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:01,593 INFO L481 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-10-25 00:14:01,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:14:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-10-25 00:14:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-25 00:14:01,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:01,603 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] [2018-10-25 00:14:01,603 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:01,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1899321928, now seen corresponding path program 1 times [2018-10-25 00:14:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:01,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:02,027 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:14:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:14:02,028 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:02,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:14:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:14:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:02,029 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-10-25 00:14:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:04,099 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-10-25 00:14:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:14:04,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-25 00:14:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:04,127 INFO L225 Difference]: With dead ends: 6108 [2018-10-25 00:14:04,128 INFO L226 Difference]: Without dead ends: 4009 [2018-10-25 00:14:04,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-10-25 00:14:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-10-25 00:14:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-10-25 00:14:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-10-25 00:14:04,274 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 200 [2018-10-25 00:14:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:04,275 INFO L481 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-10-25 00:14:04,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:14:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-10-25 00:14:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 00:14:04,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:04,291 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] [2018-10-25 00:14:04,292 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:04,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash 709935156, now seen corresponding path program 1 times [2018-10-25 00:14:04,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:04,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:04,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:04,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:04,580 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:14:04,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:04,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 00:14:04,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:04,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:14:04,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:14:04,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:14:04,582 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-10-25 00:14:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:06,831 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-10-25 00:14:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:14:06,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2018-10-25 00:14:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:06,901 INFO L225 Difference]: With dead ends: 12096 [2018-10-25 00:14:06,902 INFO L226 Difference]: Without dead ends: 8129 [2018-10-25 00:14:06,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:14:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-10-25 00:14:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-10-25 00:14:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-10-25 00:14:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-10-25 00:14:07,254 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 206 [2018-10-25 00:14:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:07,255 INFO L481 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-10-25 00:14:07,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:14:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-10-25 00:14:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 00:14:07,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:07,286 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:07,286 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:07,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1045586271, now seen corresponding path program 1 times [2018-10-25 00:14:07,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:07,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:07,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:07,532 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:14:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:14:07,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:07,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:14:07,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:14:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:14:07,961 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-10-25 00:14:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:10,512 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-10-25 00:14:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:14:10,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-10-25 00:14:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:10,623 INFO L225 Difference]: With dead ends: 22960 [2018-10-25 00:14:10,623 INFO L226 Difference]: Without dead ends: 15024 [2018-10-25 00:14:10,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:14:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-10-25 00:14:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-10-25 00:14:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-10-25 00:14:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-10-25 00:14:11,202 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 211 [2018-10-25 00:14:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:11,203 INFO L481 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-10-25 00:14:11,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:14:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-10-25 00:14:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-25 00:14:11,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:11,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,263 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:11,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1142196010, now seen corresponding path program 1 times [2018-10-25 00:14:11,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:11,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:11,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:11,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-25 00:14:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:11,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:14:11,693 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:11,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:14:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:14:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:11,695 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 3 states. [2018-10-25 00:14:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:14,924 INFO L93 Difference]: Finished difference Result 41273 states and 69018 transitions. [2018-10-25 00:14:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:14:14,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-10-25 00:14:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:15,054 INFO L225 Difference]: With dead ends: 41273 [2018-10-25 00:14:15,055 INFO L226 Difference]: Without dead ends: 26413 [2018-10-25 00:14:15,128 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:14:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26413 states. [2018-10-25 00:14:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26413 to 26410. [2018-10-25 00:14:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26410 states. [2018-10-25 00:14:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26410 states to 26410 states and 41323 transitions. [2018-10-25 00:14:16,082 INFO L78 Accepts]: Start accepts. Automaton has 26410 states and 41323 transitions. Word has length 235 [2018-10-25 00:14:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:16,083 INFO L481 AbstractCegarLoop]: Abstraction has 26410 states and 41323 transitions. [2018-10-25 00:14:16,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:14:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26410 states and 41323 transitions. [2018-10-25 00:14:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-25 00:14:16,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:16,174 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:16,174 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:16,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1569214991, now seen corresponding path program 1 times [2018-10-25 00:14:16,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:16,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:16,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:16,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 80 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-25 00:14:16,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:14:16,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:14:16,655 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-10-25 00:14:16,658 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [64], [65], [68], [71], [75], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:14:16,729 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:14:16,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:14:21,707 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:14:21,709 INFO L272 AbstractInterpreter]: Visited 192 different actions 377 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:14:21,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:21,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:14:27,172 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 82.36% of their original sizes. [2018-10-25 00:14:27,172 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:14:35,866 INFO L413 sIntCurrentIteration]: We have 252 unified AI predicates [2018-10-25 00:14:35,867 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:14:35,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:14:35,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-25 00:14:35,868 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:35,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:14:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:14:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:14:35,870 INFO L87 Difference]: Start difference. First operand 26410 states and 41323 transitions. Second operand 14 states. [2018-10-25 00:16:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:16:24,272 INFO L93 Difference]: Finished difference Result 64246 states and 100429 transitions. [2018-10-25 00:16:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:16:24,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 253 [2018-10-25 00:16:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:16:24,414 INFO L225 Difference]: With dead ends: 64246 [2018-10-25 00:16:24,414 INFO L226 Difference]: Without dead ends: 37842 [2018-10-25 00:16:24,493 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 99 SyntacticMatches, 141 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-10-25 00:16:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37842 states. [2018-10-25 00:16:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37842 to 37824. [2018-10-25 00:16:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37824 states. [2018-10-25 00:16:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37824 states to 37824 states and 57010 transitions. [2018-10-25 00:16:25,527 INFO L78 Accepts]: Start accepts. Automaton has 37824 states and 57010 transitions. Word has length 253 [2018-10-25 00:16:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:16:25,528 INFO L481 AbstractCegarLoop]: Abstraction has 37824 states and 57010 transitions. [2018-10-25 00:16:25,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:16:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 37824 states and 57010 transitions. [2018-10-25 00:16:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-25 00:16:25,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:16:25,591 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-25 00:16:25,591 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:16:25,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:16:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash 94695274, now seen corresponding path program 1 times [2018-10-25 00:16:25,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:16:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:25,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:16:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:25,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:16:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:16:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 124 proven. 18 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-25 00:16:26,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:16:26,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:16:26,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-10-25 00:16:26,119 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:16:26,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:16:26,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:16:32,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:16:32,312 INFO L272 AbstractInterpreter]: Visited 194 different actions 580 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:16:32,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:16:32,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:16:32,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:16:32,317 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:16:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:16:32,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:16:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:16:32,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:16:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-25 00:16:32,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:16:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-25 00:16:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:16:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:16:33,831 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:16:33,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:16:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:16:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:16:33,833 INFO L87 Difference]: Start difference. First operand 37824 states and 57010 transitions. Second operand 9 states. [2018-10-25 00:16:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:16:39,238 INFO L93 Difference]: Finished difference Result 108545 states and 169567 transitions. [2018-10-25 00:16:39,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:16:39,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 279 [2018-10-25 00:16:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:16:39,640 INFO L225 Difference]: With dead ends: 108545 [2018-10-25 00:16:39,640 INFO L226 Difference]: Without dead ends: 71544 [2018-10-25 00:16:39,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 554 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:16:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71544 states. [2018-10-25 00:16:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71544 to 70754. [2018-10-25 00:16:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70754 states. [2018-10-25 00:16:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70754 states to 70754 states and 101319 transitions. [2018-10-25 00:16:41,925 INFO L78 Accepts]: Start accepts. Automaton has 70754 states and 101319 transitions. Word has length 279 [2018-10-25 00:16:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:16:41,926 INFO L481 AbstractCegarLoop]: Abstraction has 70754 states and 101319 transitions. [2018-10-25 00:16:41,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:16:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 70754 states and 101319 transitions. [2018-10-25 00:16:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-25 00:16:42,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:16:42,036 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:16:42,037 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:16:42,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:16:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash 761764562, now seen corresponding path program 1 times [2018-10-25 00:16:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:16:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:16:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:42,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:16:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:16:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:16:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:16:42,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:16:42,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:16:42,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:16:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:16:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:16:42,756 INFO L87 Difference]: Start difference. First operand 70754 states and 101319 transitions. Second operand 4 states. [2018-10-25 00:16:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:16:46,747 INFO L93 Difference]: Finished difference Result 172399 states and 247066 transitions. [2018-10-25 00:16:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:16:46,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-10-25 00:16:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:16:47,161 INFO L225 Difference]: With dead ends: 172399 [2018-10-25 00:16:47,161 INFO L226 Difference]: Without dead ends: 102468 [2018-10-25 00:16:47,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:16:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102468 states. [2018-10-25 00:16:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102468 to 100488. [2018-10-25 00:16:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100488 states. [2018-10-25 00:16:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100488 states to 100488 states and 139443 transitions. [2018-10-25 00:16:50,139 INFO L78 Accepts]: Start accepts. Automaton has 100488 states and 139443 transitions. Word has length 294 [2018-10-25 00:16:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:16:50,140 INFO L481 AbstractCegarLoop]: Abstraction has 100488 states and 139443 transitions. [2018-10-25 00:16:50,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:16:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 100488 states and 139443 transitions. [2018-10-25 00:16:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-25 00:16:50,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:16:50,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-25 00:16:50,226 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:16:50,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:16:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 197204448, now seen corresponding path program 1 times [2018-10-25 00:16:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:16:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:50,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:16:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:16:50,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:16:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:16:50,929 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-25 00:16:51,202 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-25 00:16:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-25 00:16:51,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:16:51,538 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:16:51,539 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-10-25 00:16:51,539 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [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], [378], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:16:51,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:16:51,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:16:58,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:16:58,239 INFO L272 AbstractInterpreter]: Visited 193 different actions 574 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:16:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:16:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:16:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:16:58,247 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:16:58,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:16:58,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:16:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:16:58,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:17:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-25 00:17:01,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:17:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-25 00:17:01,892 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:17:01,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-25 00:17:01,893 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:17:01,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:17:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:17:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:17:01,894 INFO L87 Difference]: Start difference. First operand 100488 states and 139443 transitions. Second operand 3 states. [2018-10-25 00:17:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:17:04,174 INFO L93 Difference]: Finished difference Result 194702 states and 270590 transitions. [2018-10-25 00:17:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:17:04,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-10-25 00:17:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:17:04,523 INFO L225 Difference]: With dead ends: 194702 [2018-10-25 00:17:04,523 INFO L226 Difference]: Without dead ends: 94950 [2018-10-25 00:17:04,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:17:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94950 states. [2018-10-25 00:17:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94950 to 91269. [2018-10-25 00:17:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91269 states. [2018-10-25 00:17:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91269 states to 91269 states and 117943 transitions. [2018-10-25 00:17:06,631 INFO L78 Accepts]: Start accepts. Automaton has 91269 states and 117943 transitions. Word has length 302 [2018-10-25 00:17:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:17:06,632 INFO L481 AbstractCegarLoop]: Abstraction has 91269 states and 117943 transitions. [2018-10-25 00:17:06,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:17:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 91269 states and 117943 transitions. [2018-10-25 00:17:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-25 00:17:06,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:17:06,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,758 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:17:06,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:17:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash 931388912, now seen corresponding path program 1 times [2018-10-25 00:17:06,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:17:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:17:06,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:17:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:17:06,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:17:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:17:07,447 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-25 00:17:07,707 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:17:07,985 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:17:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 192 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-25 00:17:08,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:17:08,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:17:08,392 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-10-25 00:17:08,393 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [44], [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], [256], [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], [436], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:17:08,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:17:08,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:17:09,979 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:17:09,980 INFO L272 AbstractInterpreter]: Visited 192 different actions 378 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:17:09,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:17:09,989 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:17:14,234 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 73.43% of their original sizes. [2018-10-25 00:17:14,235 INFO L411 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-10-25 00:17:19,497 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 00:17:19,502 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 00:17:19,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:17:19 BoogieIcfgContainer [2018-10-25 00:17:19,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:17:19,504 INFO L168 Benchmark]: Toolchain (without parser) took 217526.86 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 00:17:19,505 INFO L168 Benchmark]: CDTParser took 0.25 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:17:19,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1176.29 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:19,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 331.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:19,508 INFO L168 Benchmark]: Boogie Preprocessor took 158.48 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:17:19,509 INFO L168 Benchmark]: RCFGBuilder took 5131.24 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: 253.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:19,509 INFO L168 Benchmark]: TraceAbstraction took 210724.22 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-25 00:17:19,515 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.25 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 1176.29 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 331.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.48 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 5131.24 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: 253.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210724.22 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1575]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1575). Cancelled while BasicCegarLoop was analyzing trace of length 369 with TraceHistMax 4,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 210.6s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 143.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2480 SDtfs, 11348 SDslu, 1813 SDs, 0 SdLazy, 17863 SolverSat, 2404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1501 GetRequests, 1278 SyntacticMatches, 151 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100488occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 19.6s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9989781850405061 AbsIntWeakeningRatio, 0.23747980613893377 AbsIntAvgWeakeningVarsNumRemoved, 0.8206785137318255 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 7162 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 3143 NumberOfCodeBlocks, 3143 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3709 ConstructedInterpolants, 0 QuantifiedInterpolants, 2644071 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2692 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 1237/1287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown