java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:20:34,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:20:34,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:20:34,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:20:34,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:20:34,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:20:34,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:20:34,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:20:34,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:20:34,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:20:34,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:20:34,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:20:34,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:20:34,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:20:34,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:20:34,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:20:34,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:20:34,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:20:34,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:20:34,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:20:34,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:20:34,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:20:34,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:20:34,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:20:34,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:20:34,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:20:34,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:20:34,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:20:34,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:20:34,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:20:34,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:20:34,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:20:34,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:20:34,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:20:34,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:20:34,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:20:34,632 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:20:34,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:20:34,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:20:34,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:20:34,660 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:20:34,660 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:20:34,661 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:20:34,661 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:20:34,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:20:34,661 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:20:34,661 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:20:34,661 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:20:34,662 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:20:34,662 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:20:34,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:20:34,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:20:34,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:20:34,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:20:34,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:20:34,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:20:34,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:20:34,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:20:34,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:20:34,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:20:34,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:20:34,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:20:34,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:20:34,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:20:34,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:20:34,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:20:34,666 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:20:34,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:20:34,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:20:34,666 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:20:34,667 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:20:34,667 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:20:34,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:20:34,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:20:34,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:20:34,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:20:34,735 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:20:34,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-12 17:20:34,795 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25183c52/db85f45488d449f1aaf8ef75feb166e2/FLAG08c07d80d [2018-11-12 17:20:35,409 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:20:35,410 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-12 17:20:35,433 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25183c52/db85f45488d449f1aaf8ef75feb166e2/FLAG08c07d80d [2018-11-12 17:20:35,454 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25183c52/db85f45488d449f1aaf8ef75feb166e2 [2018-11-12 17:20:35,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:20:35,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:20:35,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:20:35,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:20:35,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:20:35,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:20:35" (1/1) ... [2018-11-12 17:20:35,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48866cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:35, skipping insertion in model container [2018-11-12 17:20:35,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:20:35" (1/1) ... [2018-11-12 17:20:35,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:20:35,590 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:20:36,482 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:20:36,489 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:20:36,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:20:36,816 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:20:36,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36 WrapperNode [2018-11-12 17:20:36,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:20:36,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:20:36,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:20:36,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:20:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:20:37,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:20:37,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:20:37,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:20:37,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... [2018-11-12 17:20:37,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:20:37,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:20:37,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:20:37,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:20:37,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:20:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:20:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:20:37,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:20:37,228 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:20:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:20:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:20:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:20:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:20:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:20:41,951 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:20:41,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:20:41 BoogieIcfgContainer [2018-11-12 17:20:41,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:20:41,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:20:41,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:20:41,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:20:41,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:20:35" (1/3) ... [2018-11-12 17:20:41,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bddf3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:20:41, skipping insertion in model container [2018-11-12 17:20:41,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:36" (2/3) ... [2018-11-12 17:20:41,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bddf3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:20:41, skipping insertion in model container [2018-11-12 17:20:41,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:20:41" (3/3) ... [2018-11-12 17:20:41,967 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-11-12 17:20:41,979 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:20:41,991 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:20:42,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:20:42,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:20:42,070 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:20:42,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:20:42,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:20:42,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:20:42,071 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:20:42,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:20:42,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:20:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-12 17:20:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-12 17:20:42,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:20:42,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:20:42,160 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:20:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:20:42,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-11-12 17:20:42,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:20:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:42,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:20:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:42,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:20:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:20:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:20:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:20:43,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 17:20:43,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:20:43,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 17:20:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 17:20:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:20:43,535 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-12 17:20:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:20:46,668 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-12 17:20:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:20:46,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-12 17:20:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:20:46,697 INFO L225 Difference]: With dead ends: 1066 [2018-11-12 17:20:46,697 INFO L226 Difference]: Without dead ends: 748 [2018-11-12 17:20:46,706 INFO L604 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-11-12 17:20:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-12 17:20:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-12 17:20:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-12 17:20:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-12 17:20:46,806 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-11-12 17:20:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:20:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-12 17:20:46,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 17:20:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-12 17:20:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 17:20:46,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:20:46,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:20:46,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:20:46,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:20:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-11-12 17:20:46,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:20:46,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:46,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:20:46,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:46,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:20:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:20:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:20:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:20:47,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:20:47,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:20:47,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:20:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:20:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:20:47,176 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-12 17:20:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:20:50,524 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-12 17:20:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:20:50,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-11-12 17:20:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:20:50,536 INFO L225 Difference]: With dead ends: 1590 [2018-11-12 17:20:50,537 INFO L226 Difference]: Without dead ends: 1069 [2018-11-12 17:20:50,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:20:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-12 17:20:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-12 17:20:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-12 17:20:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-12 17:20:50,616 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-11-12 17:20:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:20:50,617 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-12 17:20:50,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:20:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-12 17:20:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-12 17:20:50,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:20:50,624 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:20:50,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:20:50,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:20:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-11-12 17:20:50,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:20:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:20:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:50,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:20:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:20:50,919 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:20:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:20:51,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:20:51,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:20:51,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:20:51,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:20:51,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:20:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:20:51,140 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-12 17:20:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:20:54,216 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-12 17:20:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:20:54,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-11-12 17:20:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:20:54,240 INFO L225 Difference]: With dead ends: 3166 [2018-11-12 17:20:54,240 INFO L226 Difference]: Without dead ends: 2148 [2018-11-12 17:20:54,248 INFO L604 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-11-12 17:20:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-12 17:20:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-12 17:20:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-12 17:20:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-12 17:20:54,355 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-11-12 17:20:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:20:54,355 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-12 17:20:54,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:20:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-12 17:20:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-12 17:20:54,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:20:54,366 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:20:54,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:20:54,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:20:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-11-12 17:20:54,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:20:54,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:54,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:20:54,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:54,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:20:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:20:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:20:54,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:20:54,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:20:54,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:20:54,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:20:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:20:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:20:54,831 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-12 17:20:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:20:57,247 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-12 17:20:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:20:57,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-12 17:20:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:20:57,274 INFO L225 Difference]: With dead ends: 6108 [2018-11-12 17:20:57,274 INFO L226 Difference]: Without dead ends: 4009 [2018-11-12 17:20:57,285 INFO L604 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-11-12 17:20:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-12 17:20:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-12 17:20:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-12 17:20:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-12 17:20:57,409 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-11-12 17:20:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:20:57,410 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-12 17:20:57,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:20:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-12 17:20:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-12 17:20:57,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:20:57,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:20:57,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:20:57,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:20:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-11-12 17:20:57,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:20:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:20:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:20:57,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:20:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:20:57,905 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 17:20:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:20:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:20:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 17:20:58,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:20:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 17:20:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 17:20:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:20:58,201 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-12 17:21:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:00,156 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-12 17:21:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:21:00,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-11-12 17:21:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:00,230 INFO L225 Difference]: With dead ends: 12096 [2018-11-12 17:21:00,230 INFO L226 Difference]: Without dead ends: 8129 [2018-11-12 17:21:00,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:21:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-12 17:21:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-12 17:21:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-12 17:21:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-12 17:21:00,585 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-11-12 17:21:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:00,586 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-12 17:21:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 17:21:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-12 17:21:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-12 17:21:00,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:00,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:00,623 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:00,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-11-12 17:21:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:00,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:00,896 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:21:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:01,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:01,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:21:01,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:01,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:21:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:21:01,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:21:01,294 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-12 17:21:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:04,010 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-12 17:21:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:21:04,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-11-12 17:21:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:04,110 INFO L225 Difference]: With dead ends: 22960 [2018-11-12 17:21:04,110 INFO L226 Difference]: Without dead ends: 15024 [2018-11-12 17:21:04,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:21:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-12 17:21:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-12 17:21:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-12 17:21:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-12 17:21:04,641 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-11-12 17:21:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:04,641 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-12 17:21:04,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:21:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-12 17:21:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-12 17:21:04,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:04,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:04,707 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:04,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-11-12 17:21:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:04,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:04,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:05,370 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 17:21:05,631 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 17:21:06,242 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 17:21:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 17:21:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:06,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:21:06,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:06,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:21:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:21:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:21:06,490 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-11-12 17:21:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:11,403 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-11-12 17:21:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 17:21:11,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-11-12 17:21:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:11,474 INFO L225 Difference]: With dead ends: 31818 [2018-11-12 17:21:11,474 INFO L226 Difference]: Without dead ends: 16918 [2018-11-12 17:21:11,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:21:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-11-12 17:21:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-11-12 17:21:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-11-12 17:21:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-11-12 17:21:11,982 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-11-12 17:21:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:11,983 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-11-12 17:21:11,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:21:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-11-12 17:21:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-12 17:21:12,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:12,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 17:21:12,055 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:12,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:12,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-11-12 17:21:12,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:12,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:12,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:21:12,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:12,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:21:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:21:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:21:12,386 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-11-12 17:21:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:14,323 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-11-12 17:21:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:21:14,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-12 17:21:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:14,450 INFO L225 Difference]: With dead ends: 46520 [2018-11-12 17:21:14,450 INFO L226 Difference]: Without dead ends: 29610 [2018-11-12 17:21:14,501 INFO L604 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-11-12 17:21:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-11-12 17:21:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-11-12 17:21:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-11-12 17:21:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-11-12 17:21:15,284 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-11-12 17:21:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:15,284 INFO L480 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-11-12 17:21:15,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:21:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-11-12 17:21:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-12 17:21:15,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:15,620 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 17:21:15,621 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:15,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-11-12 17:21:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:15,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:15,938 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:21:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:21:16,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:21:16,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:21:16,034 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-11-12 17:21:16,037 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [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], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:21:16,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:21:16,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:21:17,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:21:17,600 INFO L272 AbstractInterpreter]: Visited 208 different actions 208 times. Never merged. Never widened. Performed 3510 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3510 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 88 variables. [2018-11-12 17:21:17,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:17,645 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:21:19,290 INFO L227 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.78% of their original sizes. [2018-11-12 17:21:19,291 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:21:20,356 INFO L415 sIntCurrentIteration]: We unified 295 AI predicates to 295 [2018-11-12 17:21:20,357 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:21:20,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:21:20,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 26 [2018-11-12 17:21:20,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:20,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:21:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:21:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:21:20,360 INFO L87 Difference]: Start difference. First operand 29560 states and 45643 transitions. Second operand 18 states. [2018-11-12 17:21:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:42,339 INFO L93 Difference]: Finished difference Result 59324 states and 91543 transitions. [2018-11-12 17:21:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:21:42,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 296 [2018-11-12 17:21:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:42,435 INFO L225 Difference]: With dead ends: 59324 [2018-11-12 17:21:42,436 INFO L226 Difference]: Without dead ends: 29770 [2018-11-12 17:21:42,508 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:21:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2018-11-12 17:21:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29768. [2018-11-12 17:21:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29768 states. [2018-11-12 17:21:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29768 states to 29768 states and 45861 transitions. [2018-11-12 17:21:43,218 INFO L78 Accepts]: Start accepts. Automaton has 29768 states and 45861 transitions. Word has length 296 [2018-11-12 17:21:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:43,218 INFO L480 AbstractCegarLoop]: Abstraction has 29768 states and 45861 transitions. [2018-11-12 17:21:43,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:21:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29768 states and 45861 transitions. [2018-11-12 17:21:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-12 17:21:43,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:43,289 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, 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] [2018-11-12 17:21:43,290 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:43,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1257760584, now seen corresponding path program 1 times [2018-11-12 17:21:43,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:43,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:43,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:43,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:43,633 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:21:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 17:21:44,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:21:44,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:21:44,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-12 17:21:44,321 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], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:21:44,330 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:21:44,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:21:46,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:21:46,774 INFO L272 AbstractInterpreter]: Visited 212 different actions 418 times. Merged at 5 different actions 5 times. Never widened. Performed 9763 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9763 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:21:46,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:46,783 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:21:49,589 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 81.11% of their original sizes. [2018-11-12 17:21:49,590 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:21:54,413 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-11-12 17:21:54,413 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:21:54,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:21:54,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [8] total 31 [2018-11-12 17:21:54,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:54,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 17:21:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 17:21:54,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:21:54,415 INFO L87 Difference]: Start difference. First operand 29768 states and 45861 transitions. Second operand 25 states. [2018-11-12 17:23:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:23:08,558 INFO L93 Difference]: Finished difference Result 60580 states and 93071 transitions. [2018-11-12 17:23:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:23:08,558 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 308 [2018-11-12 17:23:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:23:08,692 INFO L225 Difference]: With dead ends: 60580 [2018-11-12 17:23:08,692 INFO L226 Difference]: Without dead ends: 31026 [2018-11-12 17:23:08,796 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 318 GetRequests, 243 SyntacticMatches, 41 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 17:23:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31026 states. [2018-11-12 17:23:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31026 to 31022. [2018-11-12 17:23:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2018-11-12 17:23:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 47245 transitions. [2018-11-12 17:23:09,786 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 47245 transitions. Word has length 308 [2018-11-12 17:23:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:23:09,787 INFO L480 AbstractCegarLoop]: Abstraction has 31022 states and 47245 transitions. [2018-11-12 17:23:09,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 17:23:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 47245 transitions. [2018-11-12 17:23:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-12 17:23:09,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:23:09,865 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 17:23:09,865 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:23:09,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1083232552, now seen corresponding path program 1 times [2018-11-12 17:23:09,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:23:09,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:23:09,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:09,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:23:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:23:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 161 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:23:10,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:23:10,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:23:10,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-11-12 17:23:10,514 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], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:23:10,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:23:10,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:23:13,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:23:13,363 INFO L272 AbstractInterpreter]: Visited 212 different actions 420 times. Merged at 5 different actions 7 times. Never widened. Performed 9871 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9871 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:23:13,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:13,371 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:23:14,645 INFO L227 lantSequenceWeakener]: Weakened 326 states. On average, predicates are now at 73.28% of their original sizes. [2018-11-12 17:23:14,646 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:23:14,979 INFO L415 sIntCurrentIteration]: We unified 330 AI predicates to 330 [2018-11-12 17:23:14,980 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:23:14,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:23:14,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:23:14,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:23:14,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:23:14,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:23:14,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:23:14,981 INFO L87 Difference]: Start difference. First operand 31022 states and 47245 transitions. Second operand 19 states. [2018-11-12 17:24:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:24:16,753 INFO L93 Difference]: Finished difference Result 68786 states and 104128 transitions. [2018-11-12 17:24:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:24:16,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 331 [2018-11-12 17:24:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:24:16,890 INFO L225 Difference]: With dead ends: 68786 [2018-11-12 17:24:16,890 INFO L226 Difference]: Without dead ends: 39020 [2018-11-12 17:24:16,953 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-11-12 17:24:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39020 states. [2018-11-12 17:24:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39020 to 38778. [2018-11-12 17:24:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38778 states. [2018-11-12 17:24:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38778 states to 38778 states and 56998 transitions. [2018-11-12 17:24:17,761 INFO L78 Accepts]: Start accepts. Automaton has 38778 states and 56998 transitions. Word has length 331 [2018-11-12 17:24:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:24:17,762 INFO L480 AbstractCegarLoop]: Abstraction has 38778 states and 56998 transitions. [2018-11-12 17:24:17,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:24:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 38778 states and 56998 transitions. [2018-11-12 17:24:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-12 17:24:17,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:24:17,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:24:17,836 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:24:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:24:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1760477341, now seen corresponding path program 1 times [2018-11-12 17:24:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:24:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:24:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:24:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:24:17,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:24:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:24:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 160 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:24:18,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:24:18,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:24:18,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-11-12 17:24:18,495 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [44], [45], [49], [52], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [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], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:24:18,500 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:24:18,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:24:20,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:24:20,854 INFO L272 AbstractInterpreter]: Visited 211 different actions 416 times. Merged at 5 different actions 5 times. Never widened. Performed 7796 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7796 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:24:20,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:24:20,860 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:24:22,099 INFO L227 lantSequenceWeakener]: Weakened 340 states. On average, predicates are now at 73.12% of their original sizes. [2018-11-12 17:24:22,099 INFO L413 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-11-12 17:24:22,131 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 17:24:22,134 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 17:24:22,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:24:22 BoogieIcfgContainer [2018-11-12 17:24:22,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:24:22,136 INFO L168 Benchmark]: Toolchain (without parser) took 226668.64 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 180.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-12 17:24:22,137 INFO L168 Benchmark]: CDTParser took 0.19 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-11-12 17:24:22,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1348.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:22,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -850.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:22,139 INFO L168 Benchmark]: Boogie Preprocessor took 138.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:24:22,140 INFO L168 Benchmark]: RCFGBuilder took 4792.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 256.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:22,140 INFO L168 Benchmark]: TraceAbstraction took 220178.31 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 1.2 GB in the end (delta: 700.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:24:22,145 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.19 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 1348.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 204.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -850.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4792.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 256.1 MB). Peak memory consumption was 256.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220178.31 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 1.2 GB in the end (delta: 700.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while BasicCegarLoop was analyzing trace of length 344 with TraceHistMax 4,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 220.0s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 182.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2347 SDtfs, 12210 SDslu, 3146 SDs, 0 SdLazy, 18403 SolverSat, 1928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1017 GetRequests, 856 SyntacticMatches, 47 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38778occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.2s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9989403345253776 AbsIntWeakeningRatio, 0.2488226059654631 AbsIntAvgWeakeningVarsNumRemoved, 54.53061224489796 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 990 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2787 NumberOfCodeBlocks, 2787 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2776 ConstructedInterpolants, 0 QuantifiedInterpolants, 2641308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 612/750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown