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-1dbac8b [2018-10-27 00:42:18,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:42:18,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:42:18,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:42:18,523 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:42:18,524 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:42:18,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:42:18,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:42:18,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:42:18,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:42:18,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:42:18,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:42:18,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:42:18,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:42:18,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:42:18,535 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:42:18,536 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:42:18,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:42:18,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:42:18,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:42:18,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:42:18,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:42:18,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:42:18,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:42:18,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:42:18,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:42:18,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:42:18,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:42:18,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:42:18,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:42:18,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:42:18,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:42:18,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:42:18,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:42:18,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:42:18,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:42:18,553 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-27 00:42:18,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:42:18,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:42:18,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:42:18,569 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:42:18,569 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:42:18,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:42:18,569 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:42:18,570 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:42:18,570 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:42:18,570 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:42:18,570 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:42:18,570 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:42:18,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:42:18,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:42:18,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:42:18,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:42:18,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:42:18,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:42:18,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:42:18,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:42:18,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:42:18,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:42:18,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:42:18,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:42:18,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:42:18,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:42:18,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:42:18,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:42:18,574 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:42:18,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:42:18,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:42:18,575 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:42:18,575 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:42:18,575 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:42:18,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:42:18,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:42:18,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:42:18,636 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:42:18,636 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:42:18,637 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-27 00:42:18,702 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0e99a51be/05f8ac503aab42c8adbd40744ab238e1/FLAG476adc6cc [2018-10-27 00:42:19,310 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:42:19,311 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-10-27 00:42:19,326 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0e99a51be/05f8ac503aab42c8adbd40744ab238e1/FLAG476adc6cc [2018-10-27 00:42:19,340 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0e99a51be/05f8ac503aab42c8adbd40744ab238e1 [2018-10-27 00:42:19,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:42:19,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:42:19,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:42:19,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:42:19,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:42:19,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:42:19" (1/1) ... [2018-10-27 00:42:19,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63879a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:19, skipping insertion in model container [2018-10-27 00:42:19,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:42:19" (1/1) ... [2018-10-27 00:42:19,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:42:19,444 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:42:19,943 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:42:19,948 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:42:20,043 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:42:20,060 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:42:20,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20 WrapperNode [2018-10-27 00:42:20,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:42:20,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:42:20,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:42:20,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:42:20,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:42:20,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:42:20,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:42:20,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:42:20,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... [2018-10-27 00:42:20,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:42:20,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:42:20,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:42:20,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:42:20,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:42:20,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:42:20,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:42:20,395 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:42:20,395 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:42:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:42:20,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:42:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:42:20,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:42:23,797 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:42:23,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:42:23 BoogieIcfgContainer [2018-10-27 00:42:23,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:42:23,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:42:23,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:42:23,803 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:42:23,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:42:19" (1/3) ... [2018-10-27 00:42:23,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731724ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:42:23, skipping insertion in model container [2018-10-27 00:42:23,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:42:20" (2/3) ... [2018-10-27 00:42:23,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731724ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:42:23, skipping insertion in model container [2018-10-27 00:42:23,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:42:23" (3/3) ... [2018-10-27 00:42:23,806 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-10-27 00:42:23,816 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:42:23,827 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:42:23,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:42:23,884 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:42:23,884 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:42:23,884 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:42:23,885 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:42:23,885 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:42:23,885 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:42:23,885 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:42:23,885 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:42:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 00:42:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:42:23,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:23,926 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-27 00:42:23,928 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:23,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-10-27 00:42:23,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:23,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:23,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:23,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:23,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:24,563 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:42:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:24,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:24,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:42:24,713 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:24,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:42:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:42:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:42:24,740 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 00:42:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:26,233 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 00:42:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:42:26,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-10-27 00:42:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:26,253 INFO L225 Difference]: With dead ends: 550 [2018-10-27 00:42:26,254 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 00:42:26,260 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-27 00:42:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 00:42:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 00:42:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 00:42:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-27 00:42:26,371 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-10-27 00:42:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:26,372 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-27 00:42:26,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:42:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-27 00:42:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:42:26,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:26,386 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-27 00:42:26,386 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:26,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-10-27 00:42:26,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:26,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:26,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:26,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:26,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:26,677 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:42:26,827 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-27 00:42:26,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:26,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:42:26,828 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:26,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:42:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:42:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:42:26,831 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-27 00:42:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:28,571 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-27 00:42:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:42:28,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-27 00:42:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:28,579 INFO L225 Difference]: With dead ends: 888 [2018-10-27 00:42:28,579 INFO L226 Difference]: Without dead ends: 554 [2018-10-27 00:42:28,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:42:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-27 00:42:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-27 00:42:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-27 00:42:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-27 00:42:28,624 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-10-27 00:42:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:28,625 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-27 00:42:28,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:42:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-27 00:42:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 00:42:28,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:28,630 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-27 00:42:28,630 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:28,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-10-27 00:42:28,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:28,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:29,014 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-27 00:42:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:42:29,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:29,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:42:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:42:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:42:29,017 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-27 00:42:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:30,635 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-27 00:42:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:42:30,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-27 00:42:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:30,642 INFO L225 Difference]: With dead ends: 1210 [2018-10-27 00:42:30,642 INFO L226 Difference]: Without dead ends: 536 [2018-10-27 00:42:30,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:42:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-27 00:42:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-27 00:42:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-27 00:42:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-27 00:42:30,694 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-10-27 00:42:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:30,694 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-27 00:42:30,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:42:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-27 00:42:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 00:42:30,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:30,700 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-27 00:42:30,701 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:30,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-10-27 00:42:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:30,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:30,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:31,243 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-27 00:42:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:31,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:42:31,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:31,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:42:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:42:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:42:31,369 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-27 00:42:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:33,653 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-27 00:42:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:42:33,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-27 00:42:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:33,658 INFO L225 Difference]: With dead ends: 1204 [2018-10-27 00:42:33,658 INFO L226 Difference]: Without dead ends: 535 [2018-10-27 00:42:33,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:42:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-27 00:42:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-27 00:42:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-27 00:42:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-27 00:42:33,677 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-10-27 00:42:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:33,677 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-27 00:42:33,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:42:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-27 00:42:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 00:42:33,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:33,680 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-27 00:42:33,680 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:33,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-10-27 00:42:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:33,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:33,840 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-27 00:42:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:42:33,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:33,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:42:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:42:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:42:33,842 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-27 00:42:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:34,671 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-27 00:42:34,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:42:34,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-10-27 00:42:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:34,683 INFO L225 Difference]: With dead ends: 1521 [2018-10-27 00:42:34,683 INFO L226 Difference]: Without dead ends: 992 [2018-10-27 00:42:34,686 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-27 00:42:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-27 00:42:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-27 00:42:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-27 00:42:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-27 00:42:34,716 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-10-27 00:42:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:34,717 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-27 00:42:34,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:42:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-27 00:42:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:42:34,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:34,722 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-27 00:42:34,722 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:34,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-10-27 00:42:34,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:34,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:34,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:34,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:34,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:42:34,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:42:34,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:34,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:42:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:42:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:42:34,874 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-27 00:42:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:36,055 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-27 00:42:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:42:36,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-27 00:42:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:36,077 INFO L225 Difference]: With dead ends: 2947 [2018-10-27 00:42:36,077 INFO L226 Difference]: Without dead ends: 1961 [2018-10-27 00:42:36,086 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-27 00:42:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-27 00:42:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-27 00:42:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-27 00:42:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-27 00:42:36,171 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-10-27 00:42:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:36,172 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-27 00:42:36,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:42:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-27 00:42:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:42:36,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:36,181 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-27 00:42:36,181 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:36,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-10-27 00:42:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:42:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:36,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:36,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:42:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:36,435 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-27 00:42:36,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:36,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:42:36,437 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-10-27 00:42:36,440 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-27 00:42:36,511 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:42:36,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:42:45,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:42:45,324 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 00:42:45,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:45,336 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:42:47,614 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 79.76% of their original sizes. [2018-10-27 00:42:47,615 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:42:48,610 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-10-27 00:42:48,610 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:42:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:42:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-10-27 00:42:48,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:48,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 00:42:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 00:42:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:42:48,613 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-10-27 00:43:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:43:01,937 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-10-27 00:43:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:43:01,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-10-27 00:43:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:43:01,947 INFO L225 Difference]: With dead ends: 3911 [2018-10-27 00:43:01,947 INFO L226 Difference]: Without dead ends: 1989 [2018-10-27 00:43:01,954 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:43:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-10-27 00:43:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-10-27 00:43:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-10-27 00:43:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-10-27 00:43:02,011 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 148 [2018-10-27 00:43:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:43:02,012 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-10-27 00:43:02,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 00:43:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-10-27 00:43:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-27 00:43:02,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:43:02,020 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-27 00:43:02,020 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:43:02,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-10-27 00:43:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:43:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:02,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:43:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:43:02,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:43:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:43:02,198 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-27 00:43:02,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:43:02,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:43:02,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-10-27 00:43:02,200 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-27 00:43:02,207 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:43:02,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:43:25,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:43:25,998 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-27 00:43:26,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:43:26,008 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:43:30,441 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 80.59% of their original sizes. [2018-10-27 00:43:30,441 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:43:50,149 INFO L415 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2018-10-27 00:43:50,150 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:43:50,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:43:50,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 00:43:50,150 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:43:50,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 00:43:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 00:43:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:43:50,152 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 18 states. [2018-10-27 00:44:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:44:22,378 INFO L93 Difference]: Finished difference Result 4056 states and 5353 transitions. [2018-10-27 00:44:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 00:44:22,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2018-10-27 00:44:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:44:22,388 INFO L225 Difference]: With dead ends: 4056 [2018-10-27 00:44:22,388 INFO L226 Difference]: Without dead ends: 2134 [2018-10-27 00:44:22,394 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 54 SyntacticMatches, 86 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 00:44:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-10-27 00:44:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2127. [2018-10-27 00:44:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2018-10-27 00:44:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2768 transitions. [2018-10-27 00:44:22,452 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2768 transitions. Word has length 157 [2018-10-27 00:44:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:44:22,452 INFO L481 AbstractCegarLoop]: Abstraction has 2127 states and 2768 transitions. [2018-10-27 00:44:22,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 00:44:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2768 transitions. [2018-10-27 00:44:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 00:44:22,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:44:22,461 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:44:22,461 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:44:22,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:44:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash 949105357, now seen corresponding path program 1 times [2018-10-27 00:44:22,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:44:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:44:22,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:44:22,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:44:22,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:44:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:44:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:44:22,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:44:22,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:44:22,595 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-27 00:44:22,596 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], [137], [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-27 00:44:22,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:44:22,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:44:53,467 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:44:53,467 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-27 00:44:53,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:44:53,475 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:45:03,147 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 81.59% of their original sizes. [2018-10-27 00:45:03,148 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:46:17,546 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-10-27 00:46:17,546 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:46:17,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:46:17,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-10-27 00:46:17,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:46:17,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 00:46:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 00:46:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2018-10-27 00:46:17,548 INFO L87 Difference]: Start difference. First operand 2127 states and 2768 transitions. Second operand 26 states. Received shutdown request... [2018-10-27 00:46:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 00:46:40,817 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 00:46:40,824 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 00:46:40,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:46:40 BoogieIcfgContainer [2018-10-27 00:46:40,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:46:40,825 INFO L168 Benchmark]: Toolchain (without parser) took 261473.39 ms. Allocated memory was 1.5 GB in the beginning and 3.8 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.2 GB. Max. memory is 7.1 GB. [2018-10-27 00:46:40,826 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 00:46:40,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.19 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:46:40,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 187.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 00:46:40,829 INFO L168 Benchmark]: Boogie Preprocessor took 59.22 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 00:46:40,829 INFO L168 Benchmark]: RCFGBuilder took 3490.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. [2018-10-27 00:46:40,830 INFO L168 Benchmark]: TraceAbstraction took 257025.13 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -430.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 00:46:40,835 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 707.19 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 187.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.22 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3490.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 129.5 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257025.13 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -430.3 MB). Peak memory consumption was 1.1 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 (2127states) and FLOYD_HOARE automaton (currently 10 states, 26 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 256.9s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 78.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1136 SDtfs, 3794 SDslu, 798 SDs, 0 SdLazy, 4664 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 566 GetRequests, 363 SyntacticMatches, 103 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 105.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2127occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 63.5s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9949954203374795 AbsIntWeakeningRatio, 0.20121951219512196 AbsIntAvgWeakeningVarsNumRemoved, 1470.0365853658536 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 929966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 187/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown