java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:52:40,583 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:52:40,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:52:40,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:52:40,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:52:40,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:52:40,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:52:40,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:52:40,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:52:40,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:52:40,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:52:40,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:52:40,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:52:40,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:52:40,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:52:40,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:52:40,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:52:40,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:52:40,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:52:40,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:52:40,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:52:40,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:52:40,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:52:40,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:52:40,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:52:40,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:52:40,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:52:40,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:52:40,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:52:40,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:52:40,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:52:40,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:52:40,660 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:52:40,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:52:40,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:52:40,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:52:40,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:52:40,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:52:40,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:52:40,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:52:40,688 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:52:40,688 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:52:40,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:52:40,688 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:52:40,689 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:52:40,689 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:52:40,689 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:52:40,689 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:52:40,689 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:52:40,692 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:52:40,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:52:40,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:52:40,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:52:40,694 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:52:40,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:52:40,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:52:40,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:52:40,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:52:40,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:52:40,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:52:40,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:52:40,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:52:40,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:52:40,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:52:40,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:52:40,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:52:40,699 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:52:40,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:52:40,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:52:40,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:52:40,700 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:52:40,700 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:52:40,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:52:40,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:52:40,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:52:40,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:52:40,775 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:52:40,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-11-07 18:52:40,857 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2afee2d/8d8b55f3c70e40e693d27582ea65d818/FLAG8571824a9 [2018-11-07 18:52:41,543 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:52:41,545 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-11-07 18:52:41,565 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2afee2d/8d8b55f3c70e40e693d27582ea65d818/FLAG8571824a9 [2018-11-07 18:52:41,583 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2afee2d/8d8b55f3c70e40e693d27582ea65d818 [2018-11-07 18:52:41,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:52:41,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:52:41,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:52:41,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:52:41,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:52:41,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:41" (1/1) ... [2018-11-07 18:52:41,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f322134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:41, skipping insertion in model container [2018-11-07 18:52:41,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:52:41" (1/1) ... [2018-11-07 18:52:41,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:52:41,700 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:52:42,382 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:52:42,387 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:52:42,647 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:52:42,673 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:52:42,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42 WrapperNode [2018-11-07 18:52:42,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:52:42,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:52:42,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:52:42,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:52:42,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:52:42,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:52:42,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:52:42,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:52:42,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:42,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:43,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:43,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... [2018-11-07 18:52:43,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:52:43,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:52:43,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:52:43,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:52:43,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:52:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:52:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:52:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:52:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:52:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:52:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:52:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:52:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:52:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:52:47,770 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:52:47,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:47 BoogieIcfgContainer [2018-11-07 18:52:47,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:52:47,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:52:47,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:52:47,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:52:47,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:52:41" (1/3) ... [2018-11-07 18:52:47,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b48ca1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:47, skipping insertion in model container [2018-11-07 18:52:47,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:52:42" (2/3) ... [2018-11-07 18:52:47,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b48ca1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:52:47, skipping insertion in model container [2018-11-07 18:52:47,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:52:47" (3/3) ... [2018-11-07 18:52:47,781 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label25_true-unreach-call.c [2018-11-07 18:52:47,792 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:52:47,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:52:47,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:52:47,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:52:47,869 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:52:47,869 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:52:47,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:52:47,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:52:47,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:52:47,870 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:52:47,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:52:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-07 18:52:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 18:52:47,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:52:47,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:52:47,936 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:52:47,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:52:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1441765812, now seen corresponding path program 1 times [2018-11-07 18:52:47,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:52:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:52:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:47,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:52:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:52:48,846 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-11-07 18:52:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:52:49,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:52:49,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 18:52:49,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:52:49,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 18:52:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 18:52:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:52:49,184 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-07 18:52:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:52:52,620 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-07 18:52:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:52:52,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-07 18:52:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:52:52,650 INFO L225 Difference]: With dead ends: 1066 [2018-11-07 18:52:52,650 INFO L226 Difference]: Without dead ends: 748 [2018-11-07 18:52:52,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:52:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-07 18:52:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-07 18:52:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-07 18:52:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-07 18:52:52,793 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 187 [2018-11-07 18:52:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:52:52,795 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-07 18:52:52,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 18:52:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-07 18:52:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 18:52:52,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:52:52,818 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:52:52,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:52:52,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:52:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash 730517125, now seen corresponding path program 1 times [2018-11-07 18:52:52,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:52:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:52:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:52,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:52:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:52:53,164 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 18:52:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:52:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:52:53,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:52:53,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:52:53,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:52:53,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:52:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:52:53,258 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-07 18:52:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:52:56,239 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-07 18:52:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 18:52:56,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-11-07 18:52:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:52:56,255 INFO L225 Difference]: With dead ends: 1590 [2018-11-07 18:52:56,256 INFO L226 Difference]: Without dead ends: 1069 [2018-11-07 18:52:56,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:52:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-07 18:52:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-07 18:52:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-07 18:52:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-07 18:52:56,354 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 197 [2018-11-07 18:52:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:52:56,354 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-07 18:52:56,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:52:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-07 18:52:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 18:52:56,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:52:56,361 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:52:56,361 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:52:56,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:52:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1518817149, now seen corresponding path program 1 times [2018-11-07 18:52:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:52:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:56,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:52:56,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:56,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:52:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:52:56,602 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:52:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:52:56,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:52:56,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:52:56,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:52:56,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:52:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:52:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:52:56,838 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-07 18:52:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:52:59,718 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-07 18:52:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:52:59,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2018-11-07 18:52:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:52:59,747 INFO L225 Difference]: With dead ends: 3166 [2018-11-07 18:52:59,747 INFO L226 Difference]: Without dead ends: 2148 [2018-11-07 18:52:59,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:52:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-07 18:52:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-07 18:52:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-07 18:52:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-07 18:52:59,856 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 198 [2018-11-07 18:52:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:52:59,857 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-07 18:52:59,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:52:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-07 18:52:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 18:52:59,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:52:59,868 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:52:59,868 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:52:59,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:52:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1899321928, now seen corresponding path program 1 times [2018-11-07 18:52:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:52:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:59,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:52:59,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:52:59,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:52:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:53:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:53:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:53:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:53:00,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:53:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:53:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:53:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:53:00,257 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-07 18:53:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:53:02,402 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-07 18:53:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:53:02,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-11-07 18:53:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:53:02,429 INFO L225 Difference]: With dead ends: 6108 [2018-11-07 18:53:02,429 INFO L226 Difference]: Without dead ends: 4009 [2018-11-07 18:53:02,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:53:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-07 18:53:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-07 18:53:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-07 18:53:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-07 18:53:02,577 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 200 [2018-11-07 18:53:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:53:02,578 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-07 18:53:02,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:53:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-07 18:53:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 18:53:02,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:53:02,594 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:53:02,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:53:02,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:53:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash 709935156, now seen corresponding path program 1 times [2018-11-07 18:53:02,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:53:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:02,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:53:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:02,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:53:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:53:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:53:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:53:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 18:53:02,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:53:02,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 18:53:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 18:53:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 18:53:02,996 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-07 18:53:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:53:05,104 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-07 18:53:05,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:53:05,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2018-11-07 18:53:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:53:05,180 INFO L225 Difference]: With dead ends: 12096 [2018-11-07 18:53:05,181 INFO L226 Difference]: Without dead ends: 8129 [2018-11-07 18:53:05,202 INFO L604 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-11-07 18:53:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-07 18:53:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-07 18:53:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-07 18:53:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-07 18:53:05,505 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 206 [2018-11-07 18:53:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:53:05,506 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-07 18:53:05,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 18:53:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-07 18:53:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 18:53:05,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:53:05,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:53:05,535 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:53:05,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:53:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1045586271, now seen corresponding path program 1 times [2018-11-07 18:53:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:53:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:53:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:05,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:53:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:53:05,804 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:53:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:53:06,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:53:06,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:53:06,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:53:06,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:53:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:53:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:53:06,227 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-07 18:53:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:53:08,722 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-07 18:53:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:53:08,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-11-07 18:53:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:53:08,828 INFO L225 Difference]: With dead ends: 22960 [2018-11-07 18:53:08,828 INFO L226 Difference]: Without dead ends: 15024 [2018-11-07 18:53:08,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:53:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-07 18:53:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-07 18:53:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-07 18:53:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-07 18:53:09,399 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 211 [2018-11-07 18:53:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:53:09,399 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-07 18:53:09,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:53:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-07 18:53:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-07 18:53:09,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:53:09,454 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:53:09,458 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:53:09,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:53:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1142196010, now seen corresponding path program 1 times [2018-11-07 18:53:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:53:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:09,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:53:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:09,466 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:53:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:53:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 18:53:09,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:53:09,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:53:09,881 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:53:09,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:53:09,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:53:09,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:53:09,882 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 3 states. [2018-11-07 18:53:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:53:13,184 INFO L93 Difference]: Finished difference Result 41273 states and 69018 transitions. [2018-11-07 18:53:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:53:13,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-07 18:53:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:53:13,308 INFO L225 Difference]: With dead ends: 41273 [2018-11-07 18:53:13,308 INFO L226 Difference]: Without dead ends: 26413 [2018-11-07 18:53:13,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:53:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26413 states. [2018-11-07 18:53:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26413 to 26410. [2018-11-07 18:53:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26410 states. [2018-11-07 18:53:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26410 states to 26410 states and 41323 transitions. [2018-11-07 18:53:14,356 INFO L78 Accepts]: Start accepts. Automaton has 26410 states and 41323 transitions. Word has length 235 [2018-11-07 18:53:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:53:14,357 INFO L480 AbstractCegarLoop]: Abstraction has 26410 states and 41323 transitions. [2018-11-07 18:53:14,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:53:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 26410 states and 41323 transitions. [2018-11-07 18:53:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 18:53:14,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:53:14,443 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:53:14,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:53:14,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:53:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1569214991, now seen corresponding path program 1 times [2018-11-07 18:53:14,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:53:14,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:53:14,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:53:14,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:53:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:53:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 80 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 18:53:14,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:53:14,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:53:14,935 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 18:53:14,937 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [64], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:53:15,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:53:15,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:53:18,932 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:53:18,934 INFO L272 AbstractInterpreter]: Visited 192 different actions 377 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 18:53:18,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:53:18,981 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:53:20,927 INFO L227 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 72.74% of their original sizes. [2018-11-07 18:53:20,927 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:53:21,838 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 18:53:21,838 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:53:21,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:53:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:53:21,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:53:21,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:53:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:53:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:53:21,841 INFO L87 Difference]: Start difference. First operand 26410 states and 41323 transitions. Second operand 18 states. [2018-11-07 18:54:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:54:27,709 INFO L93 Difference]: Finished difference Result 60058 states and 92667 transitions. [2018-11-07 18:54:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 18:54:27,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 253 [2018-11-07 18:54:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:54:27,826 INFO L225 Difference]: With dead ends: 60058 [2018-11-07 18:54:27,826 INFO L226 Difference]: Without dead ends: 33654 [2018-11-07 18:54:27,898 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2018-11-07 18:54:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33654 states. [2018-11-07 18:54:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33654 to 33649. [2018-11-07 18:54:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33649 states. [2018-11-07 18:54:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33649 states to 33649 states and 50171 transitions. [2018-11-07 18:54:28,694 INFO L78 Accepts]: Start accepts. Automaton has 33649 states and 50171 transitions. Word has length 253 [2018-11-07 18:54:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:54:28,695 INFO L480 AbstractCegarLoop]: Abstraction has 33649 states and 50171 transitions. [2018-11-07 18:54:28,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:54:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33649 states and 50171 transitions. [2018-11-07 18:54:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 18:54:28,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:54:28,759 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:54:28,759 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:54:28,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash 94695274, now seen corresponding path program 1 times [2018-11-07 18:54:28,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:54:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:28,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:28,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:54:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 124 proven. 18 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 18:54:29,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:54:29,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:54:29,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-11-07 18:54:29,294 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:54:29,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:54:29,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:54:32,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:54:32,820 INFO L272 AbstractInterpreter]: Visited 194 different actions 581 times. Merged at 7 different actions 23 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 88 variables. [2018-11-07 18:54:32,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:32,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:54:32,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:54:32,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:54:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:32,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:54:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:33,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:54:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 18:54:33,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:54:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 18:54:34,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:54:34,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 18:54:34,313 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:54:34,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:54:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:54:34,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:54:34,315 INFO L87 Difference]: Start difference. First operand 33649 states and 50171 transitions. Second operand 9 states. [2018-11-07 18:54:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:54:39,219 INFO L93 Difference]: Finished difference Result 97112 states and 144608 transitions. [2018-11-07 18:54:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 18:54:39,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 279 [2018-11-07 18:54:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:54:39,515 INFO L225 Difference]: With dead ends: 97112 [2018-11-07 18:54:39,515 INFO L226 Difference]: Without dead ends: 64096 [2018-11-07 18:54:39,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 554 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:54:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64096 states. [2018-11-07 18:54:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64096 to 64082. [2018-11-07 18:54:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64082 states. [2018-11-07 18:54:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64082 states to 64082 states and 90275 transitions. [2018-11-07 18:54:41,714 INFO L78 Accepts]: Start accepts. Automaton has 64082 states and 90275 transitions. Word has length 279 [2018-11-07 18:54:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:54:41,714 INFO L480 AbstractCegarLoop]: Abstraction has 64082 states and 90275 transitions. [2018-11-07 18:54:41,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:54:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64082 states and 90275 transitions. [2018-11-07 18:54:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 18:54:41,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:54:41,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:54:41,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:54:41,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash 761764562, now seen corresponding path program 1 times [2018-11-07 18:54:41,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:54:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:41,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:54:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:54:42,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:54:42,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 18:54:42,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:54:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 18:54:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 18:54:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:54:42,545 INFO L87 Difference]: Start difference. First operand 64082 states and 90275 transitions. Second operand 4 states. [2018-11-07 18:54:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:54:45,880 INFO L93 Difference]: Finished difference Result 158780 states and 224600 transitions. [2018-11-07 18:54:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:54:45,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-11-07 18:54:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:54:46,249 INFO L225 Difference]: With dead ends: 158780 [2018-11-07 18:54:46,249 INFO L226 Difference]: Without dead ends: 95331 [2018-11-07 18:54:46,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:54:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95331 states. [2018-11-07 18:54:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95331 to 94628. [2018-11-07 18:54:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94628 states. [2018-11-07 18:54:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94628 states to 94628 states and 129417 transitions. [2018-11-07 18:54:49,240 INFO L78 Accepts]: Start accepts. Automaton has 94628 states and 129417 transitions. Word has length 294 [2018-11-07 18:54:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:54:49,240 INFO L480 AbstractCegarLoop]: Abstraction has 94628 states and 129417 transitions. [2018-11-07 18:54:49,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 18:54:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 94628 states and 129417 transitions. [2018-11-07 18:54:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 18:54:49,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:54:49,312 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:54:49,312 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:54:49,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 197204448, now seen corresponding path program 1 times [2018-11-07 18:54:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:54:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:49,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:49,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:54:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:49,920 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 18:54:50,149 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:54:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 18:54:50,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:54:50,274 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:54:50,274 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-11-07 18:54:50,275 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [28], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [378], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:54:50,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:54:50,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:54:53,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:54:54,000 INFO L272 AbstractInterpreter]: Visited 193 different actions 575 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-07 18:54:54,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:54,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:54:54,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:54:54,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:54:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:54,018 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:54:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:54,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:54:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-07 18:54:54,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:54:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-07 18:54:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:54:54,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-07 18:54:54,501 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:54:54,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:54:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:54:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:54:54,502 INFO L87 Difference]: Start difference. First operand 94628 states and 129417 transitions. Second operand 3 states. [2018-11-07 18:54:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:54:56,523 INFO L93 Difference]: Finished difference Result 183590 states and 251301 transitions. [2018-11-07 18:54:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:54:56,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-11-07 18:54:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:54:56,833 INFO L225 Difference]: With dead ends: 183590 [2018-11-07 18:54:56,834 INFO L226 Difference]: Without dead ends: 89176 [2018-11-07 18:54:57,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:54:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89176 states. [2018-11-07 18:54:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89176 to 84682. [2018-11-07 18:54:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84682 states. [2018-11-07 18:54:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84682 states to 84682 states and 108548 transitions. [2018-11-07 18:54:59,270 INFO L78 Accepts]: Start accepts. Automaton has 84682 states and 108548 transitions. Word has length 302 [2018-11-07 18:54:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:54:59,271 INFO L480 AbstractCegarLoop]: Abstraction has 84682 states and 108548 transitions. [2018-11-07 18:54:59,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:54:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 84682 states and 108548 transitions. [2018-11-07 18:54:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-07 18:54:59,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:54:59,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:54:59,355 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:54:59,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:54:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 931388912, now seen corresponding path program 1 times [2018-11-07 18:54:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:54:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:59,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:54:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:54:59,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:54:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:54:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 192 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-07 18:54:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:54:59,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:54:59,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-11-07 18:54:59,893 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [44], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [256], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:54:59,899 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:54:59,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:55:01,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:55:01,659 INFO L272 AbstractInterpreter]: Visited 192 different actions 380 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 18:55:01,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:55:01,697 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:55:04,021 INFO L227 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 71.78% of their original sizes. [2018-11-07 18:55:04,021 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:55:04,483 INFO L415 sIntCurrentIteration]: We unified 367 AI predicates to 367 [2018-11-07 18:55:04,483 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:55:04,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:55:04,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2018-11-07 18:55:04,484 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:55:04,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 18:55:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 18:55:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-11-07 18:55:04,485 INFO L87 Difference]: Start difference. First operand 84682 states and 108548 transitions. Second operand 19 states. [2018-11-07 18:55:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:55:46,806 INFO L93 Difference]: Finished difference Result 177505 states and 227754 transitions. [2018-11-07 18:55:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 18:55:46,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 368 [2018-11-07 18:55:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:55:47,035 INFO L225 Difference]: With dead ends: 177505 [2018-11-07 18:55:47,035 INFO L226 Difference]: Without dead ends: 93037 [2018-11-07 18:55:47,133 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 376 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-11-07 18:55:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93037 states. [2018-11-07 18:55:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93037 to 93030. [2018-11-07 18:55:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93030 states. [2018-11-07 18:55:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93030 states to 93030 states and 117887 transitions. [2018-11-07 18:55:48,575 INFO L78 Accepts]: Start accepts. Automaton has 93030 states and 117887 transitions. Word has length 368 [2018-11-07 18:55:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:55:48,575 INFO L480 AbstractCegarLoop]: Abstraction has 93030 states and 117887 transitions. [2018-11-07 18:55:48,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 18:55:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93030 states and 117887 transitions. [2018-11-07 18:55:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 18:55:48,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:55:48,665 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:55:48,665 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:55:48,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:55:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2013488484, now seen corresponding path program 1 times [2018-11-07 18:55:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:55:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:55:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:55:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:55:48,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:55:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:55:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 243 proven. 74 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-07 18:55:49,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:55:49,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:55:49,104 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 390 with the following transitions: [2018-11-07 18:55:49,104 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [28], [29], [33], [37], [41], [44], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [256], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [338], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 18:55:49,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:55:49,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:55:55,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:55:55,236 INFO L272 AbstractInterpreter]: Visited 195 different actions 973 times. Merged at 9 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-07 18:55:55,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:55:55,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:55:55,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:55:55,246 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:55:55,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:55:55,256 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:55:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:55:55,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:55:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 321 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 18:55:56,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:55:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 265 proven. 102 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 18:55:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:55:57,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2018-11-07 18:55:57,212 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:55:57,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 18:55:57,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 18:55:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-07 18:55:57,213 INFO L87 Difference]: Start difference. First operand 93030 states and 117887 transitions. Second operand 14 states. [2018-11-07 18:55:57,442 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 18:56:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:56:13,097 INFO L93 Difference]: Finished difference Result 463459 states and 643290 transitions. [2018-11-07 18:56:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 18:56:13,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 389 [2018-11-07 18:56:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:56:14,857 INFO L225 Difference]: With dead ends: 463459 [2018-11-07 18:56:14,857 INFO L226 Difference]: Without dead ends: 370853 [2018-11-07 18:56:15,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 841 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1332, Invalid=7224, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 18:56:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370853 states. Received shutdown request... [2018-11-07 18:56:17,240 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 18:56:17,245 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 18:56:17,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:56:17 BoogieIcfgContainer [2018-11-07 18:56:17,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:56:17,246 INFO L168 Benchmark]: Toolchain (without parser) took 215650.77 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,248 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:56:17,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1075.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 207.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -901.6 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,251 INFO L168 Benchmark]: Boogie Preprocessor took 176.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,252 INFO L168 Benchmark]: RCFGBuilder took 4712.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.9 MB). Peak memory consumption was 253.9 MB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,253 INFO L168 Benchmark]: TraceAbstraction took 209473.60 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 18:56:17,258 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 1075.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 207.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -901.6 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 176.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4712.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.9 MB). Peak memory consumption was 253.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209473.60 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.6 GB). Free memory was 2.0 GB in the beginning and 3.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1575]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1575). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 209.3s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 158.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2941 SDtfs, 23261 SDslu, 3655 SDs, 0 SdLazy, 20961 SolverSat, 5332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 97.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2817 GetRequests, 2606 SyntacticMatches, 14 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3396 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94628occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 19.2s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9989855392106513 AbsIntWeakeningRatio, 0.23747980613893377 AbsIntAvgWeakeningVarsNumRemoved, 65.61227786752828 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 5916 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 4289 NumberOfCodeBlocks, 4289 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5240 ConstructedInterpolants, 0 QuantifiedInterpolants, 3713038 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 2640/2888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown