java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:28:55,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:28:55,710 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:28:55,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:28:55,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:28:55,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:28:55,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:28:55,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:28:55,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:28:55,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:28:55,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:28:55,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:28:55,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:28:55,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:28:55,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:28:55,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:28:55,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:28:55,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:28:55,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:28:55,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:28:55,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:28:55,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:28:55,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:28:55,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:28:55,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:28:55,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:28:55,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:28:55,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:28:55,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:28:55,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:28:55,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:28:55,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:28:55,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:28:55,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:28:55,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:28:55,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:28:55,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:28:55,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:28:55,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:28:55,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:28:55,773 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:28:55,773 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:28:55,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:28:55,774 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:28:55,774 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:28:55,774 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:28:55,774 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:28:55,774 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:28:55,775 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:28:55,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:28:55,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:28:55,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:28:55,776 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:28:55,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:28:55,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:28:55,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:28:55,777 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:28:55,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:28:55,777 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:28:55,777 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:28:55,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:28:55,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:28:55,778 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:28:55,778 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:28:55,778 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:28:55,778 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:28:55,779 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:28:55,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:28:55,779 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:28:55,779 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:28:55,779 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:28:55,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:28:55,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:28:55,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:28:55,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:28:55,841 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:28:55,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-10-27 12:28:55,902 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5c47e103d/c8a69432061c4b4292d4f31c908fdbd5/FLAGce38a7f77 [2018-10-27 12:28:56,589 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:28:56,590 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-10-27 12:28:56,612 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5c47e103d/c8a69432061c4b4292d4f31c908fdbd5/FLAGce38a7f77 [2018-10-27 12:28:56,631 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5c47e103d/c8a69432061c4b4292d4f31c908fdbd5 [2018-10-27 12:28:56,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:28:56,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:28:56,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:28:56,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:28:56,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:28:56,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:28:56" (1/1) ... [2018-10-27 12:28:56,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec89115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:56, skipping insertion in model container [2018-10-27 12:28:56,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:28:56" (1/1) ... [2018-10-27 12:28:56,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:28:56,772 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:28:57,484 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:28:57,490 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:28:57,842 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:28:57,867 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:28:57,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57 WrapperNode [2018-10-27 12:28:57,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:28:57,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:28:57,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:28:57,869 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:28:57,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:57,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:28:58,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:28:58,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:28:58,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:28:58,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... [2018-10-27 12:28:58,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:28:58,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:28:58,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:28:58,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:28:58,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:28:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:28:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:28:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:28:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:28:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:28:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:28:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:28:58,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:29:02,880 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:29:02,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:29:02 BoogieIcfgContainer [2018-10-27 12:29:02,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:29:02,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:29:02,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:29:02,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:29:02,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:28:56" (1/3) ... [2018-10-27 12:29:02,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b40f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:29:02, skipping insertion in model container [2018-10-27 12:29:02,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:28:57" (2/3) ... [2018-10-27 12:29:02,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b40f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:29:02, skipping insertion in model container [2018-10-27 12:29:02,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:29:02" (3/3) ... [2018-10-27 12:29:02,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-10-27 12:29:02,901 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:29:02,913 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:29:02,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:29:02,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:29:02,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:29:02,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:29:02,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:29:02,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:29:02,971 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:29:02,972 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:29:02,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:29:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-27 12:29:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-27 12:29:03,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:03,039 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-10-27 12:29:03,042 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:03,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-10-27 12:29:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:03,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:03,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:03,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:04,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:04,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 12:29:04,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:04,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 12:29:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 12:29:04,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:29:04,284 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-10-27 12:29:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:07,385 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-10-27 12:29:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:29:07,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-27 12:29:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:07,416 INFO L225 Difference]: With dead ends: 1066 [2018-10-27 12:29:07,416 INFO L226 Difference]: Without dead ends: 748 [2018-10-27 12:29:07,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:29:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-27 12:29:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-10-27 12:29:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-27 12:29:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-10-27 12:29:07,520 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-10-27 12:29:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:07,524 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-10-27 12:29:07,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 12:29:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-10-27 12:29:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-27 12:29:07,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:07,543 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-10-27 12:29:07,543 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:07,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-10-27 12:29:07,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:07,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:07,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:07,966 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 12:29:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:08,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:29:08,140 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:08,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:29:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:29:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:29:08,142 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-10-27 12:29:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:11,611 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-10-27 12:29:11,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:29:11,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-10-27 12:29:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:11,626 INFO L225 Difference]: With dead ends: 1590 [2018-10-27 12:29:11,627 INFO L226 Difference]: Without dead ends: 1069 [2018-10-27 12:29:11,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:29:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-27 12:29:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-10-27 12:29:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-27 12:29:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-10-27 12:29:11,712 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-10-27 12:29:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:11,712 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-10-27 12:29:11,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:29:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-10-27 12:29:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-27 12:29:11,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:11,719 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-10-27 12:29:11,719 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:11,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-10-27 12:29:11,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:11,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:11,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:11,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:29:11,875 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:11,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:29:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:29:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:29:11,876 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-10-27 12:29:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:15,429 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-10-27 12:29:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:29:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-10-27 12:29:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:15,455 INFO L225 Difference]: With dead ends: 3166 [2018-10-27 12:29:15,456 INFO L226 Difference]: Without dead ends: 2148 [2018-10-27 12:29:15,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 12:29:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-10-27 12:29:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-10-27 12:29:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-10-27 12:29:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-10-27 12:29:15,567 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-10-27 12:29:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:15,568 INFO L481 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-10-27 12:29:15,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:29:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-10-27 12:29:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 12:29:15,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:15,579 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:29:15,579 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:15,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-10-27 12:29:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:15,582 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:16,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:29:16,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:16,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:29:16,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:29:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:29:16,010 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-10-27 12:29:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:18,032 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-10-27 12:29:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:29:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-27 12:29:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:18,066 INFO L225 Difference]: With dead ends: 6108 [2018-10-27 12:29:18,066 INFO L226 Difference]: Without dead ends: 4009 [2018-10-27 12:29:18,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:29:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-10-27 12:29:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-10-27 12:29:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-10-27 12:29:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-10-27 12:29:18,216 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-10-27 12:29:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:18,217 INFO L481 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-10-27 12:29:18,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:29:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-10-27 12:29:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-27 12:29:18,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:18,236 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-10-27 12:29:18,236 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:18,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-10-27 12:29:18,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:18,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:18,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:18,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:18,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:18,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 12:29:18,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:18,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 12:29:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 12:29:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 12:29:18,624 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-10-27 12:29:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:20,590 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-10-27 12:29:20,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:29:20,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-10-27 12:29:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:20,654 INFO L225 Difference]: With dead ends: 12096 [2018-10-27 12:29:20,654 INFO L226 Difference]: Without dead ends: 8129 [2018-10-27 12:29:20,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:29:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-10-27 12:29:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-10-27 12:29:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-10-27 12:29:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-10-27 12:29:20,994 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-10-27 12:29:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:20,994 INFO L481 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-10-27 12:29:20,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 12:29:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-10-27 12:29:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 12:29:21,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:21,031 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-10-27 12:29:21,031 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:21,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:21,032 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-10-27 12:29:21,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:21,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:21,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:21,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:21,287 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:29:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:21,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:21,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:29:21,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:21,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:29:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:29:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:29:21,676 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-10-27 12:29:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:24,295 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-10-27 12:29:24,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:29:24,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-10-27 12:29:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:24,392 INFO L225 Difference]: With dead ends: 22960 [2018-10-27 12:29:24,392 INFO L226 Difference]: Without dead ends: 15024 [2018-10-27 12:29:24,425 INFO L605 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-10-27 12:29:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-10-27 12:29:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-10-27 12:29:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-10-27 12:29:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-10-27 12:29:24,902 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-10-27 12:29:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:24,902 INFO L481 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-10-27 12:29:24,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:29:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-10-27 12:29:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-27 12:29:24,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:24,956 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-10-27 12:29:24,956 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:24,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-10-27 12:29:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:24,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:25,529 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 12:29:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 12:29:25,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:25,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:29:25,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:25,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:29:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:29:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:29:25,905 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-10-27 12:29:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:30,508 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-10-27 12:29:30,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 12:29:30,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-10-27 12:29:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:30,576 INFO L225 Difference]: With dead ends: 31818 [2018-10-27 12:29:30,577 INFO L226 Difference]: Without dead ends: 16918 [2018-10-27 12:29:30,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:29:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-10-27 12:29:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-10-27 12:29:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-10-27 12:29:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-10-27 12:29:31,023 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-10-27 12:29:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:31,024 INFO L481 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-10-27 12:29:31,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:29:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-10-27 12:29:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-27 12:29:31,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:31,081 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-10-27 12:29:31,082 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:31,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-10-27 12:29:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:31,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:31,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:29:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:29:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:29:31,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:31,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:29:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:29:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:29:31,447 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-10-27 12:29:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:33,931 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-10-27 12:29:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:29:33,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-10-27 12:29:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:34,066 INFO L225 Difference]: With dead ends: 46520 [2018-10-27 12:29:34,067 INFO L226 Difference]: Without dead ends: 29610 [2018-10-27 12:29:34,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:29:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-10-27 12:29:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-10-27 12:29:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-10-27 12:29:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-10-27 12:29:34,828 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-10-27 12:29:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:34,829 INFO L481 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-10-27 12:29:34,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:29:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-10-27 12:29:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-27 12:29:34,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:29:34,957 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-10-27 12:29:34,957 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:29:34,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-10-27 12:29:34,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:29:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:34,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:29:34,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:29:34,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:29:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:29:35,299 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:29:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:29:35,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:29:35,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:29:35,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-10-27 12:29:35,952 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-10-27 12:29:36,022 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:29:36,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:29:37,446 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:29:37,455 INFO L272 AbstractInterpreter]: Visited 208 different actions 208 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-10-27 12:29:37,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:29:37,499 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:29:38,835 INFO L227 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.78% of their original sizes. [2018-10-27 12:29:38,836 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:29:40,116 INFO L415 sIntCurrentIteration]: We unified 295 AI predicates to 295 [2018-10-27 12:29:40,116 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:29:40,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:29:40,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 26 [2018-10-27 12:29:40,118 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:29:40,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:29:40,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:29:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:29:40,119 INFO L87 Difference]: Start difference. First operand 29560 states and 45643 transitions. Second operand 18 states. [2018-10-27 12:29:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:29:59,155 INFO L93 Difference]: Finished difference Result 59324 states and 91543 transitions. [2018-10-27 12:29:59,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:29:59,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 296 [2018-10-27 12:29:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:29:59,259 INFO L225 Difference]: With dead ends: 59324 [2018-10-27 12:29:59,259 INFO L226 Difference]: Without dead ends: 29770 [2018-10-27 12:29:59,329 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-10-27 12:29:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2018-10-27 12:29:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29768. [2018-10-27 12:29:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29768 states. [2018-10-27 12:29:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29768 states to 29768 states and 45861 transitions. [2018-10-27 12:29:59,976 INFO L78 Accepts]: Start accepts. Automaton has 29768 states and 45861 transitions. Word has length 296 [2018-10-27 12:29:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:29:59,976 INFO L481 AbstractCegarLoop]: Abstraction has 29768 states and 45861 transitions. [2018-10-27 12:29:59,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:29:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29768 states and 45861 transitions. [2018-10-27 12:30:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-27 12:30:00,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:30:00,045 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-10-27 12:30:00,045 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:30:00,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:30:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1257760584, now seen corresponding path program 1 times [2018-10-27 12:30:00,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:30:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:30:00,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:30:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:30:00,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:30:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:30:00,406 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:30:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 12:30:01,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:30:01,163 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:30:01,164 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-10-27 12:30:01,164 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-10-27 12:30:01,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:30:01,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:30:03,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:30:03,033 INFO L272 AbstractInterpreter]: Visited 212 different actions 420 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-27 12:30:03,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:30:03,041 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:30:04,522 INFO L227 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 78.96% of their original sizes. [2018-10-27 12:30:04,523 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:30:05,536 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-10-27 12:30:05,536 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:30:05,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:30:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [8] total 30 [2018-10-27 12:30:05,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:30:05,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 12:30:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 12:30:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-10-27 12:30:05,538 INFO L87 Difference]: Start difference. First operand 29768 states and 45861 transitions. Second operand 24 states. [2018-10-27 12:30:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:30:52,799 INFO L93 Difference]: Finished difference Result 60580 states and 93071 transitions. [2018-10-27 12:30:52,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:30:52,799 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 308 [2018-10-27 12:30:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:30:52,883 INFO L225 Difference]: With dead ends: 60580 [2018-10-27 12:30:52,883 INFO L226 Difference]: Without dead ends: 31026 [2018-10-27 12:30:52,924 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 316 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 12:30:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31026 states. [2018-10-27 12:30:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31026 to 31022. [2018-10-27 12:30:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2018-10-27 12:30:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 47245 transitions. [2018-10-27 12:30:53,511 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 47245 transitions. Word has length 308 [2018-10-27 12:30:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:30:53,511 INFO L481 AbstractCegarLoop]: Abstraction has 31022 states and 47245 transitions. [2018-10-27 12:30:53,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 12:30:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 47245 transitions. [2018-10-27 12:30:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-27 12:30:53,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:30:53,575 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-10-27 12:30:53,575 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:30:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:30:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1083232552, now seen corresponding path program 1 times [2018-10-27 12:30:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:30:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:30:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:30:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:30:53,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:30:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:30:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 161 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 12:30:54,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:30:54,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:30:54,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-10-27 12:30:54,242 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-10-27 12:30:54,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:30:54,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:30:55,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:30:55,519 INFO L272 AbstractInterpreter]: Visited 212 different actions 417 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-27 12:30:55,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:30:55,529 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:30:56,850 INFO L227 lantSequenceWeakener]: Weakened 326 states. On average, predicates are now at 73.28% of their original sizes. [2018-10-27 12:30:56,850 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:30:57,204 INFO L415 sIntCurrentIteration]: We unified 330 AI predicates to 330 [2018-10-27 12:30:57,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:30:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:30:57,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-27 12:30:57,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:30:57,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 12:30:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 12:30:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:30:57,206 INFO L87 Difference]: Start difference. First operand 31022 states and 47245 transitions. Second operand 19 states. [2018-10-27 12:31:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:31:31,674 INFO L93 Difference]: Finished difference Result 68786 states and 104128 transitions. [2018-10-27 12:31:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 12:31:31,674 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 331 [2018-10-27 12:31:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:31:31,799 INFO L225 Difference]: With dead ends: 68786 [2018-10-27 12:31:31,799 INFO L226 Difference]: Without dead ends: 39020 [2018-10-27 12:31:31,859 INFO L605 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-10-27 12:31:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39020 states. [2018-10-27 12:31:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39020 to 38778. [2018-10-27 12:31:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38778 states. [2018-10-27 12:31:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38778 states to 38778 states and 56998 transitions. [2018-10-27 12:31:32,588 INFO L78 Accepts]: Start accepts. Automaton has 38778 states and 56998 transitions. Word has length 331 [2018-10-27 12:31:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:31:32,588 INFO L481 AbstractCegarLoop]: Abstraction has 38778 states and 56998 transitions. [2018-10-27 12:31:32,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 12:31:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 38778 states and 56998 transitions. [2018-10-27 12:31:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-27 12:31:32,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:31:32,667 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-10-27 12:31:32,667 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:31:32,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:31:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1760477341, now seen corresponding path program 1 times [2018-10-27 12:31:32,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:31:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:31:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:31:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:31:32,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:31:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:31:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 160 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:31:34,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:31:34,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:31:34,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-10-27 12:31:34,558 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-10-27 12:31:34,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:31:34,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:31:35,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:31:35,700 INFO L272 AbstractInterpreter]: Visited 211 different actions 416 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-27 12:31:35,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:31:35,709 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:31:36,684 INFO L227 lantSequenceWeakener]: Weakened 340 states. On average, predicates are now at 73.12% of their original sizes. [2018-10-27 12:31:36,684 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:31:37,071 INFO L415 sIntCurrentIteration]: We unified 342 AI predicates to 342 [2018-10-27 12:31:37,072 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:31:37,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:31:37,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 28 [2018-10-27 12:31:37,072 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:31:37,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 12:31:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 12:31:37,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:31:37,074 INFO L87 Difference]: Start difference. First operand 38778 states and 56998 transitions. Second operand 20 states. [2018-10-27 12:32:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:32:14,840 INFO L93 Difference]: Finished difference Result 81521 states and 120866 transitions. [2018-10-27 12:32:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 12:32:14,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 343 [2018-10-27 12:32:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:32:14,980 INFO L225 Difference]: With dead ends: 81521 [2018-10-27 12:32:14,980 INFO L226 Difference]: Without dead ends: 44211 [2018-10-27 12:32:15,046 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-10-27 12:32:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44211 states. [2018-10-27 12:32:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44211 to 44174. [2018-10-27 12:32:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44174 states. [2018-10-27 12:32:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44174 states to 44174 states and 63675 transitions. [2018-10-27 12:32:16,105 INFO L78 Accepts]: Start accepts. Automaton has 44174 states and 63675 transitions. Word has length 343 [2018-10-27 12:32:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:32:16,106 INFO L481 AbstractCegarLoop]: Abstraction has 44174 states and 63675 transitions. [2018-10-27 12:32:16,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 12:32:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44174 states and 63675 transitions. [2018-10-27 12:32:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-27 12:32:16,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:32:16,185 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2018-10-27 12:32:16,185 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:32:16,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:32:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -530087424, now seen corresponding path program 1 times [2018-10-27 12:32:16,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:32:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:32:16,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:32:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:32:16,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:32:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:32:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 12:32:16,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:32:16,579 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:32:16,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 356 with the following transitions: [2018-10-27 12:32:16,580 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [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-10-27 12:32:16,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:32:16,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:32:18,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:32:18,661 INFO L272 AbstractInterpreter]: Visited 212 different actions 635 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 88 variables. [2018-10-27 12:32:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:32:18,665 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:32:20,247 INFO L227 lantSequenceWeakener]: Weakened 352 states. On average, predicates are now at 73.07% of their original sizes. [2018-10-27 12:32:20,248 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:32:20,773 INFO L415 sIntCurrentIteration]: We unified 354 AI predicates to 354 [2018-10-27 12:32:20,773 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:32:20,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:32:20,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [9] total 32 [2018-10-27 12:32:20,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:32:20,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 12:32:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 12:32:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-10-27 12:32:20,775 INFO L87 Difference]: Start difference. First operand 44174 states and 63675 transitions. Second operand 25 states. Received shutdown request... [2018-10-27 12:32:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 12:32:43,816 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 12:32:43,821 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 12:32:43,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:32:43 BoogieIcfgContainer [2018-10-27 12:32:43,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:32:43,823 INFO L168 Benchmark]: Toolchain (without parser) took 227174.79 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,824 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-10-27 12:32:43,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1218.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 312.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,826 INFO L168 Benchmark]: Boogie Preprocessor took 127.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,827 INFO L168 Benchmark]: RCFGBuilder took 4572.61 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: 262.9 MB). Peak memory consumption was 262.9 MB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,828 INFO L168 Benchmark]: TraceAbstraction took 220939.36 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-27 12:32:43,833 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 1218.11 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 312.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4572.61 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: 262.9 MB). Peak memory consumption was 262.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220939.36 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.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 constructing difference of abstraction (44174states) and FLOYD_HOARE automaton (currently 14 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (2147 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 220.8s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 186.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2724 SDtfs, 20562 SDslu, 3760 SDs, 0 SdLazy, 21213 SolverSat, 2306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1728 GetRequests, 1553 SyntacticMatches, 6 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44174occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.9s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9989136915955387 AbsIntWeakeningRatio, 0.24262899262899262 AbsIntAvgWeakeningVarsNumRemoved, 63.353194103194106 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1027 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 3485 NumberOfCodeBlocks, 3485 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3472 ConstructedInterpolants, 0 QuantifiedInterpolants, 3183432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 947/1157 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown