java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 23:14:57,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 23:14:57,699 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 23:14:57,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 23:14:57,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 23:14:57,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 23:14:57,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 23:14:57,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 23:14:57,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 23:14:57,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 23:14:57,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 23:14:57,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 23:14:57,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 23:14:57,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 23:14:57,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 23:14:57,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 23:14:57,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 23:14:57,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 23:14:57,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 23:14:57,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 23:14:57,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 23:14:57,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 23:14:57,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 23:14:57,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 23:14:57,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 23:14:57,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 23:14:57,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 23:14:57,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 23:14:57,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 23:14:57,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 23:14:57,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 23:14:57,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 23:14:57,774 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 23:14:57,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 23:14:57,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 23:14:57,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 23:14:57,776 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 23:14:57,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 23:14:57,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 23:14:57,793 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 23:14:57,793 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 23:14:57,793 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 23:14:57,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 23:14:57,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 23:14:57,794 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 23:14:57,794 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 23:14:57,794 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 23:14:57,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 23:14:57,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 23:14:57,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 23:14:57,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 23:14:57,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 23:14:57,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 23:14:57,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 23:14:57,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 23:14:57,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 23:14:57,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 23:14:57,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 23:14:57,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 23:14:57,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 23:14:57,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 23:14:57,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 23:14:57,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 23:14:57,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 23:14:57,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 23:14:57,799 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 23:14:57,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 23:14:57,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 23:14:57,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 23:14:57,799 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 23:14:57,800 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 23:14:57,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 23:14:57,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 23:14:57,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 23:14:57,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 23:14:57,873 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 23:14:57,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-10-23 23:14:57,940 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/adea5cad4/0776b08b9acd47d48bafe6601501975b/FLAG8106283ce [2018-10-23 23:14:58,558 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 23:14:58,559 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-10-23 23:14:58,572 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/adea5cad4/0776b08b9acd47d48bafe6601501975b/FLAG8106283ce [2018-10-23 23:14:58,588 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/adea5cad4/0776b08b9acd47d48bafe6601501975b [2018-10-23 23:14:58,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 23:14:58,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 23:14:58,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 23:14:58,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 23:14:58,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 23:14:58,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:14:58" (1/1) ... [2018-10-23 23:14:58,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c443bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:58, skipping insertion in model container [2018-10-23 23:14:58,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:14:58" (1/1) ... [2018-10-23 23:14:58,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 23:14:58,678 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 23:14:59,099 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 23:14:59,104 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 23:14:59,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 23:14:59,303 INFO L193 MainTranslator]: Completed translation [2018-10-23 23:14:59,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59 WrapperNode [2018-10-23 23:14:59,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 23:14:59,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 23:14:59,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 23:14:59,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 23:14:59,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 23:14:59,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 23:14:59,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 23:14:59,523 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 23:14:59,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... [2018-10-23 23:14:59,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 23:14:59,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 23:14:59,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 23:14:59,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 23:14:59,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 23:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 23:14:59,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 23:14:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-23 23:14:59,672 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-23 23:14:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 23:14:59,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 23:14:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 23:14:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 23:15:02,954 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 23:15:02,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:15:02 BoogieIcfgContainer [2018-10-23 23:15:02,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 23:15:02,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 23:15:02,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 23:15:02,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 23:15:02,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:14:58" (1/3) ... [2018-10-23 23:15:02,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b8196a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:15:02, skipping insertion in model container [2018-10-23 23:15:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:14:59" (2/3) ... [2018-10-23 23:15:02,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b8196a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:15:02, skipping insertion in model container [2018-10-23 23:15:02,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:15:02" (3/3) ... [2018-10-23 23:15:02,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-10-23 23:15:02,981 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 23:15:02,994 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 23:15:03,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 23:15:03,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 23:15:03,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 23:15:03,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 23:15:03,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 23:15:03,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 23:15:03,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 23:15:03,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 23:15:03,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 23:15:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-23 23:15:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-23 23:15:03,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:03,099 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] [2018-10-23 23:15:03,102 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:03,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-10-23 23:15:03,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:03,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:03,753 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-23 23:15:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:03,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:03,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 23:15:03,885 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:03,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 23:15:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 23:15:03,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 23:15:03,913 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-23 23:15:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:05,526 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-23 23:15:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 23:15:05,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-10-23 23:15:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:05,555 INFO L225 Difference]: With dead ends: 550 [2018-10-23 23:15:05,555 INFO L226 Difference]: Without dead ends: 340 [2018-10-23 23:15:05,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 23:15:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-23 23:15:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-23 23:15:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-23 23:15:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-23 23:15:05,662 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-10-23 23:15:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:05,663 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-23 23:15:05,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 23:15:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-23 23:15:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-23 23:15:05,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:05,676 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 23:15:05,676 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:05,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-10-23 23:15:05,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:05,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:05,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:05,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 23:15:05,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:05,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 23:15:05,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 23:15:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-23 23:15:05,963 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-23 23:15:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:07,606 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-23 23:15:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 23:15:07,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-23 23:15:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:07,613 INFO L225 Difference]: With dead ends: 888 [2018-10-23 23:15:07,613 INFO L226 Difference]: Without dead ends: 554 [2018-10-23 23:15:07,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-23 23:15:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-23 23:15:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-23 23:15:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-23 23:15:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-23 23:15:07,661 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-10-23 23:15:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:07,661 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-23 23:15:07,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 23:15:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-23 23:15:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-23 23:15:07,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:07,666 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 23:15:07,667 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-10-23 23:15:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:07,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:07,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:08,107 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-23 23:15:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:08,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:08,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 23:15:08,252 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:08,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 23:15:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 23:15:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 23:15:08,254 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-23 23:15:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:10,376 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-23 23:15:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 23:15:10,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-23 23:15:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:10,383 INFO L225 Difference]: With dead ends: 1210 [2018-10-23 23:15:10,385 INFO L226 Difference]: Without dead ends: 536 [2018-10-23 23:15:10,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 23:15:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-23 23:15:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-23 23:15:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-23 23:15:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-23 23:15:10,429 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-10-23 23:15:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:10,432 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-23 23:15:10,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 23:15:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-23 23:15:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-23 23:15:10,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:10,435 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] [2018-10-23 23:15:10,436 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:10,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-10-23 23:15:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:10,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:10,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:10,797 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-23 23:15:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 23:15:10,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:10,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 23:15:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 23:15:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 23:15:10,960 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-23 23:15:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:12,904 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-23 23:15:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 23:15:12,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-23 23:15:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:12,909 INFO L225 Difference]: With dead ends: 1204 [2018-10-23 23:15:12,910 INFO L226 Difference]: Without dead ends: 535 [2018-10-23 23:15:12,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 23:15:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-23 23:15:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-23 23:15:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-23 23:15:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-23 23:15:12,930 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-10-23 23:15:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:12,930 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-23 23:15:12,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 23:15:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-23 23:15:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-23 23:15:12,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:12,934 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 23:15:12,934 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:12,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-10-23 23:15:12,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:12,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:12,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:13,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:13,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 23:15:13,115 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:13,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 23:15:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 23:15:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 23:15:13,116 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-23 23:15:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:13,913 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-23 23:15:13,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 23:15:13,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-10-23 23:15:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:13,929 INFO L225 Difference]: With dead ends: 1521 [2018-10-23 23:15:13,930 INFO L226 Difference]: Without dead ends: 992 [2018-10-23 23:15:13,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 23:15:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-23 23:15:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-23 23:15:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-23 23:15:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-23 23:15:13,973 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-10-23 23:15:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:13,973 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-23 23:15:13,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 23:15:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-23 23:15:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-23 23:15:13,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:13,980 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] [2018-10-23 23:15:13,981 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:13,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-10-23 23:15:13,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:13,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:13,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:13,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:13,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:14,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 23:15:14,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 23:15:14,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:14,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 23:15:14,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 23:15:14,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-23 23:15:14,156 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-23 23:15:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:15,391 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-23 23:15:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 23:15:15,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-23 23:15:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:15,406 INFO L225 Difference]: With dead ends: 2947 [2018-10-23 23:15:15,406 INFO L226 Difference]: Without dead ends: 1961 [2018-10-23 23:15:15,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-23 23:15:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-23 23:15:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-23 23:15:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-23 23:15:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-23 23:15:15,494 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-10-23 23:15:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:15,494 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-23 23:15:15,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 23:15:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-23 23:15:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-23 23:15:15,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:15,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 23:15:15,503 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:15,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:15,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-10-23 23:15:15,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:15,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 23:15:15,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 23:15:15,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 23:15:15,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-10-23 23:15:15,775 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-23 23:15:15,864 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 23:15:15,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 23:15:24,566 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-23 23:15:24,568 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-23 23:15:24,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:24,580 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-23 23:15:27,059 INFO L232 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 79.76% of their original sizes. [2018-10-23 23:15:27,059 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-23 23:15:27,981 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-23 23:15:27,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 23:15:27,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-10-23 23:15:27,983 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:15:27,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-23 23:15:27,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-23 23:15:27,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-23 23:15:27,984 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-10-23 23:15:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 23:15:41,430 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-10-23 23:15:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 23:15:41,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-10-23 23:15:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 23:15:41,440 INFO L225 Difference]: With dead ends: 3911 [2018-10-23 23:15:41,441 INFO L226 Difference]: Without dead ends: 1989 [2018-10-23 23:15:41,447 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-23 23:15:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-10-23 23:15:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-10-23 23:15:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-10-23 23:15:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-10-23 23:15:41,508 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 148 [2018-10-23 23:15:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 23:15:41,508 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-10-23 23:15:41,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-23 23:15:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-10-23 23:15:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-23 23:15:41,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 23:15:41,516 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 23:15:41,517 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 23:15:41,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:15:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-10-23 23:15:41,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 23:15:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:41,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 23:15:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 23:15:41,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 23:15:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 23:15:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 23:15:41,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 23:15:41,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 23:15:41,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-10-23 23:15:41,703 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-23 23:15:41,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 23:15:41,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 23:16:02,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-23 23:16:02,393 INFO L272 AbstractInterpreter]: Visited 125 different actions 191 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-23 23:16:02,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 23:16:02,400 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-23 23:16:06,241 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.93% of their original sizes. [2018-10-23 23:16:06,241 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-23 23:17:23,137 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-23 23:17:23,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 23:17:23,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-23 23:17:23,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 23:17:23,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-23 23:17:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-23 23:17:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-10-23 23:17:23,140 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 19 states. Received shutdown request... [2018-10-23 23:19:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-23 23:19:19,121 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 23:19:19,127 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 23:19:19,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 11:19:19 BoogieIcfgContainer [2018-10-23 23:19:19,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 23:19:19,129 INFO L168 Benchmark]: Toolchain (without parser) took 260527.79 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,130 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 23:19:19,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.85 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 217.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -786.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,133 INFO L168 Benchmark]: Boogie Preprocessor took 74.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,133 INFO L168 Benchmark]: RCFGBuilder took 3358.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,134 INFO L168 Benchmark]: TraceAbstraction took 256171.03 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -457.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-23 23:19:19,139 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.85 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 217.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -786.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3358.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.0 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256171.03 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: -457.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 518]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 518). Cancelled while BasicCegarLoop was constructing difference of abstraction (1989states) and FLOYD_HOARE automaton (currently 25 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (3602 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 256.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 138.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1090 SDtfs, 3679 SDslu, 938 SDs, 0 SdLazy, 5119 SolverSat, 867 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 371 GetRequests, 203 SyntacticMatches, 97 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 92.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1989occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 29.5s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9947946014113612 AbsIntWeakeningRatio, 0.21122112211221122 AbsIntAvgWeakeningVarsNumRemoved, 1970.194719471947 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1104 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1096 ConstructedInterpolants, 0 QuantifiedInterpolants, 869297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 99/121 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown