java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:49:31,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:49:31,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:49:31,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:49:31,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:49:31,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:49:31,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:49:31,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:49:31,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:49:31,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:49:31,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:49:31,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:49:31,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:49:31,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:49:31,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:49:31,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:49:31,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:49:31,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:49:31,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:49:31,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:49:31,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:49:31,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:49:31,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:49:31,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:49:31,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:49:31,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:49:31,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:49:31,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:49:31,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:49:31,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:49:31,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:49:31,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:49:31,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:49:31,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:49:31,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:49:31,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:49:31,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 10:49:31,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:49:31,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:49:31,675 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:49:31,675 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:49:31,676 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:49:31,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:49:31,677 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:49:31,680 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:49:31,680 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:49:31,680 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:49:31,681 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:49:31,681 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:49:31,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:49:31,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:49:31,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:49:31,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:49:31,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:49:31,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:49:31,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:49:31,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:49:31,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:49:31,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:49:31,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:49:31,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:49:31,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:49:31,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:49:31,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:49:31,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:49:31,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:49:31,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:49:31,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:49:31,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:49:31,686 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:49:31,686 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:49:31,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:49:31,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:49:31,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:49:31,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:49:31,761 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:49:31,762 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-07 10:49:31,818 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ff8f5c/b88828e741f245f89c329eb6b1effcca/FLAGb32ecf4ab [2018-11-07 10:49:32,404 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:49:32,405 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-07 10:49:32,424 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ff8f5c/b88828e741f245f89c329eb6b1effcca/FLAGb32ecf4ab [2018-11-07 10:49:32,449 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64ff8f5c/b88828e741f245f89c329eb6b1effcca [2018-11-07 10:49:32,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:49:32,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:49:32,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:49:32,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:49:32,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:49:32,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:49:32" (1/1) ... [2018-11-07 10:49:32,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46117c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:32, skipping insertion in model container [2018-11-07 10:49:32,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:49:32" (1/1) ... [2018-11-07 10:49:32,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:49:32,552 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:49:33,068 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:49:33,073 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:49:33,186 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:49:33,208 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:49:33,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33 WrapperNode [2018-11-07 10:49:33,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:49:33,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:49:33,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:49:33,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:49:33,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:49:33,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:49:33,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:49:33,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:49:33,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... [2018-11-07 10:49:33,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:49:33,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:49:33,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:49:33,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:49:33,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:49:33,534 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 10:49:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:49:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:49:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 10:49:33,535 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 10:49:33,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:49:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:49:33,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:49:33,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:49:36,678 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:49:36,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:49:36 BoogieIcfgContainer [2018-11-07 10:49:36,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:49:36,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:49:36,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:49:36,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:49:36,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:49:32" (1/3) ... [2018-11-07 10:49:36,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a22422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:49:36, skipping insertion in model container [2018-11-07 10:49:36,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:49:33" (2/3) ... [2018-11-07 10:49:36,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a22422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:49:36, skipping insertion in model container [2018-11-07 10:49:36,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:49:36" (3/3) ... [2018-11-07 10:49:36,688 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label20_false-unreach-call_false-termination.c [2018-11-07 10:49:36,699 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:49:36,712 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:49:36,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:49:36,764 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:49:36,765 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:49:36,765 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:49:36,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:49:36,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:49:36,765 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:49:36,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:49:36,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:49:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 10:49:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 10:49:36,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:36,819 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] [2018-11-07 10:49:36,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:36,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1836367149, now seen corresponding path program 1 times [2018-11-07 10:49:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:36,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:37,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:49:37,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:49:37,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:37,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:49:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:49:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:37,521 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 10:49:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:39,034 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 10:49:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:49:39,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-07 10:49:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:39,058 INFO L225 Difference]: With dead ends: 550 [2018-11-07 10:49:39,058 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 10:49:39,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 10:49:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 10:49:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 10:49:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 10:49:39,164 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 79 [2018-11-07 10:49:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:39,165 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 10:49:39,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:49:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 10:49:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 10:49:39,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:39,176 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] [2018-11-07 10:49:39,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:39,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1539527022, now seen corresponding path program 1 times [2018-11-07 10:49:39,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:39,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:39,181 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:39,470 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 10:49:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:39,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:49:39,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:49:39,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:39,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:49:39,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:49:39,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:49:39,557 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 10:49:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:41,316 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 10:49:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:49:41,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-07 10:49:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:41,323 INFO L225 Difference]: With dead ends: 888 [2018-11-07 10:49:41,324 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 10:49:41,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:49:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 10:49:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 10:49:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 10:49:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 10:49:41,370 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 90 [2018-11-07 10:49:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:41,371 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 10:49:41,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:49:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 10:49:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 10:49:41,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:41,376 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] [2018-11-07 10:49:41,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:41,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1217877146, now seen corresponding path program 1 times [2018-11-07 10:49:41,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:41,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:41,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:41,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:41,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:49:41,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:49:41,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:41,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:49:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:49:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:41,549 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 10:49:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:42,773 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-07 10:49:42,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:49:42,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-07 10:49:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:42,786 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 10:49:42,786 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 10:49:42,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 10:49:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 10:49:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 10:49:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-07 10:49:42,847 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 91 [2018-11-07 10:49:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-07 10:49:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:49:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-07 10:49:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 10:49:42,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:42,865 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] [2018-11-07 10:49:42,865 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:42,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1260901286, now seen corresponding path program 1 times [2018-11-07 10:49:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:42,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:43,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:49:43,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:49:43,018 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:43,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:49:43,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:49:43,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:43,019 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-07 10:49:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:44,886 INFO L93 Difference]: Finished difference Result 2877 states and 4284 transitions. [2018-11-07 10:49:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:49:44,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-07 10:49:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:44,909 INFO L225 Difference]: With dead ends: 2877 [2018-11-07 10:49:44,909 INFO L226 Difference]: Without dead ends: 1886 [2018-11-07 10:49:44,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:49:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-11-07 10:49:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2018-11-07 10:49:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-11-07 10:49:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2689 transitions. [2018-11-07 10:49:45,000 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2689 transitions. Word has length 97 [2018-11-07 10:49:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:45,001 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 2689 transitions. [2018-11-07 10:49:45,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:49:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2689 transitions. [2018-11-07 10:49:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-07 10:49:45,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:45,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:49:45,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:45,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1827829834, now seen corresponding path program 1 times [2018-11-07 10:49:45,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:45,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:45,010 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:45,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:49:45,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:49:45,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:45,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:49:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:49:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:49:45,227 INFO L87 Difference]: Start difference. First operand 1886 states and 2689 transitions. Second operand 6 states. [2018-11-07 10:49:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:46,756 INFO L93 Difference]: Finished difference Result 3816 states and 5597 transitions. [2018-11-07 10:49:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:49:46,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-07 10:49:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:46,772 INFO L225 Difference]: With dead ends: 3816 [2018-11-07 10:49:46,772 INFO L226 Difference]: Without dead ends: 1936 [2018-11-07 10:49:46,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:49:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-07 10:49:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1885. [2018-11-07 10:49:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-11-07 10:49:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2473 transitions. [2018-11-07 10:49:46,854 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2473 transitions. Word has length 105 [2018-11-07 10:49:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:46,855 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 2473 transitions. [2018-11-07 10:49:46,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:49:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2473 transitions. [2018-11-07 10:49:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 10:49:46,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:46,863 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:49:46,863 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:46,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 982006726, now seen corresponding path program 1 times [2018-11-07 10:49:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:46,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:47,196 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 10:49:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:49:47,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:49:47,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:49:47,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-11-07 10:49:47,430 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:49:47,502 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:49:47,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:49:49,484 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:49:49,487 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 10:49:49,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:49,531 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:49:50,774 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 79.56% of their original sizes. [2018-11-07 10:49:50,774 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:49:51,318 INFO L415 sIntCurrentIteration]: We unified 112 AI predicates to 112 [2018-11-07 10:49:51,318 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:49:51,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:49:51,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-07 10:49:51,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:49:51,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:49:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:49:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:49:51,325 INFO L87 Difference]: Start difference. First operand 1885 states and 2473 transitions. Second operand 12 states. [2018-11-07 10:49:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:49:59,392 INFO L93 Difference]: Finished difference Result 3825 states and 5031 transitions. [2018-11-07 10:49:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:49:59,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-11-07 10:49:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:49:59,403 INFO L225 Difference]: With dead ends: 3825 [2018-11-07 10:49:59,404 INFO L226 Difference]: Without dead ends: 1946 [2018-11-07 10:49:59,410 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:49:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-11-07 10:49:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2018-11-07 10:49:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2018-11-07 10:49:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2543 transitions. [2018-11-07 10:49:59,557 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2543 transitions. Word has length 113 [2018-11-07 10:49:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:49:59,557 INFO L480 AbstractCegarLoop]: Abstraction has 1946 states and 2543 transitions. [2018-11-07 10:49:59,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:49:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2543 transitions. [2018-11-07 10:49:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 10:49:59,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:49:59,562 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] [2018-11-07 10:49:59,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:49:59,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:49:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 368614065, now seen corresponding path program 1 times [2018-11-07 10:49:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:49:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:59,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:49:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:49:59,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:49:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:49:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:49:59,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:49:59,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:49:59,829 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-11-07 10:49:59,829 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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:49:59,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:49:59,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:50:01,585 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:50:01,586 INFO L272 AbstractInterpreter]: Visited 83 different actions 149 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 10:50:01,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:01,622 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:50:03,014 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 10:50:03,015 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:50:03,826 INFO L415 sIntCurrentIteration]: We unified 114 AI predicates to 114 [2018-11-07 10:50:03,826 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:50:03,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:50:03,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 10:50:03,827 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:50:03,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:50:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:50:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 10:50:03,829 INFO L87 Difference]: Start difference. First operand 1946 states and 2543 transitions. Second operand 19 states. [2018-11-07 10:50:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:50:25,753 INFO L93 Difference]: Finished difference Result 4110 states and 5409 transitions. [2018-11-07 10:50:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:50:25,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-11-07 10:50:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:50:25,764 INFO L225 Difference]: With dead ends: 4110 [2018-11-07 10:50:25,764 INFO L226 Difference]: Without dead ends: 2231 [2018-11-07 10:50:25,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:50:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-11-07 10:50:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2220. [2018-11-07 10:50:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2018-11-07 10:50:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2849 transitions. [2018-11-07 10:50:25,830 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2849 transitions. Word has length 115 [2018-11-07 10:50:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:50:25,830 INFO L480 AbstractCegarLoop]: Abstraction has 2220 states and 2849 transitions. [2018-11-07 10:50:25,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:50:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2849 transitions. [2018-11-07 10:50:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 10:50:25,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:50:25,835 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:50:25,835 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:50:25,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 538280163, now seen corresponding path program 1 times [2018-11-07 10:50:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:50:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:50:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:25,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:50:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:50:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:50:25,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:50:25,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:50:25,978 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-11-07 10:50:25,978 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:50:25,982 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:50:25,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:50:28,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:50:28,735 INFO L272 AbstractInterpreter]: Visited 83 different actions 151 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 10:50:28,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:28,741 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:50:29,923 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 79.74% of their original sizes. [2018-11-07 10:50:29,923 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:50:30,006 INFO L415 sIntCurrentIteration]: We unified 116 AI predicates to 116 [2018-11-07 10:50:30,007 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:50:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:50:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 10:50:30,008 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:50:30,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:50:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:50:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:50:30,009 INFO L87 Difference]: Start difference. First operand 2220 states and 2849 transitions. Second operand 11 states. [2018-11-07 10:50:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:50:41,592 INFO L93 Difference]: Finished difference Result 5184 states and 6742 transitions. [2018-11-07 10:50:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 10:50:41,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2018-11-07 10:50:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:50:41,604 INFO L225 Difference]: With dead ends: 5184 [2018-11-07 10:50:41,604 INFO L226 Difference]: Without dead ends: 2579 [2018-11-07 10:50:41,612 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:50:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-11-07 10:50:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2573. [2018-11-07 10:50:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2018-11-07 10:50:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3138 transitions. [2018-11-07 10:50:41,676 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3138 transitions. Word has length 117 [2018-11-07 10:50:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:50:41,677 INFO L480 AbstractCegarLoop]: Abstraction has 2573 states and 3138 transitions. [2018-11-07 10:50:41,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:50:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3138 transitions. [2018-11-07 10:50:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 10:50:41,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:50:41,683 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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:50:41,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:50:41,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1534428207, now seen corresponding path program 1 times [2018-11-07 10:50:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:50:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:50:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:41,685 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:50:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:50:41,943 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 10:50:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-07 10:50:41,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:50:41,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:50:41,991 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-07 10:50:41,992 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:50:41,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:50:41,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:50:45,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:50:45,288 INFO L272 AbstractInterpreter]: Visited 83 different actions 235 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 10:50:45,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:45,294 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:50:46,696 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 79.78% of their original sizes. [2018-11-07 10:50:46,696 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:50:46,833 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-07 10:50:46,833 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:50:46,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:50:46,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 10:50:46,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:50:46,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:50:46,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:50:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:50:46,834 INFO L87 Difference]: Start difference. First operand 2573 states and 3138 transitions. Second operand 10 states. [2018-11-07 10:50:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:50:53,639 INFO L93 Difference]: Finished difference Result 5639 states and 7035 transitions. [2018-11-07 10:50:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:50:53,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-11-07 10:50:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:50:53,653 INFO L225 Difference]: With dead ends: 5639 [2018-11-07 10:50:53,653 INFO L226 Difference]: Without dead ends: 3407 [2018-11-07 10:50:53,661 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:50:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2018-11-07 10:50:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3400. [2018-11-07 10:50:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-07 10:50:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4138 transitions. [2018-11-07 10:50:53,750 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4138 transitions. Word has length 155 [2018-11-07 10:50:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:50:53,751 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4138 transitions. [2018-11-07 10:50:53,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:50:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4138 transitions. [2018-11-07 10:50:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-07 10:50:53,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:50:53,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:50:53,759 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:50:53,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1376473004, now seen corresponding path program 1 times [2018-11-07 10:50:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:50:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:53,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:50:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:50:53,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:50:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:50:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:50:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:50:54,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:50:54,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-07 10:50:54,076 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:50:54,080 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:50:54,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:50:56,195 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:50:56,196 INFO L272 AbstractInterpreter]: Visited 84 different actions 151 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 10:50:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:50:56,203 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:50:58,375 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 80.03% of their original sizes. [2018-11-07 10:50:58,376 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:50:59,308 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-07 10:50:59,309 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:50:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:50:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-07 10:50:59,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:50:59,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:50:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:50:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:50:59,311 INFO L87 Difference]: Start difference. First operand 3400 states and 4138 transitions. Second operand 24 states. [2018-11-07 10:51:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:51:19,889 INFO L93 Difference]: Finished difference Result 6881 states and 8395 transitions. [2018-11-07 10:51:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:51:19,889 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 163 [2018-11-07 10:51:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:51:19,903 INFO L225 Difference]: With dead ends: 6881 [2018-11-07 10:51:19,904 INFO L226 Difference]: Without dead ends: 3822 [2018-11-07 10:51:19,911 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 134 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=972, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 10:51:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2018-11-07 10:51:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3674. [2018-11-07 10:51:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2018-11-07 10:51:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4432 transitions. [2018-11-07 10:51:20,017 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4432 transitions. Word has length 163 [2018-11-07 10:51:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:51:20,017 INFO L480 AbstractCegarLoop]: Abstraction has 3674 states and 4432 transitions. [2018-11-07 10:51:20,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:51:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4432 transitions. [2018-11-07 10:51:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 10:51:20,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:51:20,025 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:51:20,026 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:51:20,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1517055121, now seen corresponding path program 1 times [2018-11-07 10:51:20,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:51:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:20,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:20,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:51:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:51:20,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:20,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:51:20,716 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-07 10:51:20,716 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:51:20,719 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:51:20,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:51:25,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:51:25,976 INFO L272 AbstractInterpreter]: Visited 86 different actions 419 times. Merged at 9 different actions 48 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:51:25,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:25,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:51:25,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:25,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:51:25,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:25,996 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:51:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:26,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:51:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 10:51:26,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:51:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 10:51:27,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:51:27,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 10:51:27,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:51:27,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:51:27,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:51:27,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:51:27,335 INFO L87 Difference]: Start difference. First operand 3674 states and 4432 transitions. Second operand 11 states. [2018-11-07 10:51:27,729 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 10:51:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:51:30,749 INFO L93 Difference]: Finished difference Result 8185 states and 9955 transitions. [2018-11-07 10:51:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 10:51:30,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 172 [2018-11-07 10:51:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:51:30,777 INFO L225 Difference]: With dead ends: 8185 [2018-11-07 10:51:30,778 INFO L226 Difference]: Without dead ends: 4852 [2018-11-07 10:51:30,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:51:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2018-11-07 10:51:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 4661. [2018-11-07 10:51:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2018-11-07 10:51:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 5528 transitions. [2018-11-07 10:51:30,917 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 5528 transitions. Word has length 172 [2018-11-07 10:51:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:51:30,918 INFO L480 AbstractCegarLoop]: Abstraction has 4661 states and 5528 transitions. [2018-11-07 10:51:30,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:51:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 5528 transitions. [2018-11-07 10:51:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 10:51:30,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:51:30,927 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:51:30,927 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:51:30,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:30,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1355415521, now seen corresponding path program 2 times [2018-11-07 10:51:30,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:51:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:30,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:51:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:51:31,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:31,672 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:51:31,672 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:51:31,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:51:31,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:31,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:51:31,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:51:31,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:51:31,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:51:31,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:51:31,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:51:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 10:51:31,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:51:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 10:51:32,118 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:51:32,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 10:51:32,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:51:32,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:51:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:51:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:51:32,120 INFO L87 Difference]: Start difference. First operand 4661 states and 5528 transitions. Second operand 3 states. [2018-11-07 10:51:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:51:33,132 INFO L93 Difference]: Finished difference Result 9826 states and 11797 transitions. [2018-11-07 10:51:33,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:51:33,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-07 10:51:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:51:33,163 INFO L225 Difference]: With dead ends: 9826 [2018-11-07 10:51:33,163 INFO L226 Difference]: Without dead ends: 5644 [2018-11-07 10:51:33,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:51:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2018-11-07 10:51:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5621. [2018-11-07 10:51:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2018-11-07 10:51:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 6647 transitions. [2018-11-07 10:51:33,300 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 6647 transitions. Word has length 172 [2018-11-07 10:51:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:51:33,301 INFO L480 AbstractCegarLoop]: Abstraction has 5621 states and 6647 transitions. [2018-11-07 10:51:33,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:51:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 6647 transitions. [2018-11-07 10:51:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 10:51:33,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:51:33,314 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:51:33,314 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:51:33,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1289112317, now seen corresponding path program 1 times [2018-11-07 10:51:33,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:51:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:33,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:51:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:33,316 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:51:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 64 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:51:34,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:34,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:51:34,071 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 10:51:34,071 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:51:34,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:51:34,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:51:40,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:51:40,272 INFO L272 AbstractInterpreter]: Visited 86 different actions 419 times. Merged at 9 different actions 48 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:51:40,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:40,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:51:40,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:40,281 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:51:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:40,290 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:51:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:40,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:51:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-07 10:51:40,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:51:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 116 proven. 14 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 10:51:40,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:51:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 10:51:40,635 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:51:40,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:51:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:51:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:51:40,637 INFO L87 Difference]: Start difference. First operand 5621 states and 6647 transitions. Second operand 12 states. [2018-11-07 10:51:45,738 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-11-07 10:51:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:51:46,159 INFO L93 Difference]: Finished difference Result 18775 states and 24048 transitions. [2018-11-07 10:51:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:51:46,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2018-11-07 10:51:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:51:46,211 INFO L225 Difference]: With dead ends: 18775 [2018-11-07 10:51:46,211 INFO L226 Difference]: Without dead ends: 13359 [2018-11-07 10:51:46,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:51:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13359 states. [2018-11-07 10:51:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13359 to 12660. [2018-11-07 10:51:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12660 states. [2018-11-07 10:51:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 15559 transitions. [2018-11-07 10:51:46,603 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 15559 transitions. Word has length 190 [2018-11-07 10:51:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:51:46,603 INFO L480 AbstractCegarLoop]: Abstraction has 12660 states and 15559 transitions. [2018-11-07 10:51:46,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:51:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 15559 transitions. [2018-11-07 10:51:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 10:51:46,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:51:46,630 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:51:46,631 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:51:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash -444689533, now seen corresponding path program 1 times [2018-11-07 10:51:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:51:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:46,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:46,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:51:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:51:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 132 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 10:51:47,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:51:47,085 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:51:47,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-07 10:51:47,085 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:51:47,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:51:47,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:51:49,762 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:51:49,762 INFO L272 AbstractInterpreter]: Visited 85 different actions 236 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 10:51:49,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:49,771 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:51:51,282 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 79.91% of their original sizes. [2018-11-07 10:51:51,283 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:51:51,377 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-07 10:51:51,378 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:51:51,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:51:51,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 10:51:51,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:51:51,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:51:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:51:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:51:51,380 INFO L87 Difference]: Start difference. First operand 12660 states and 15559 transitions. Second operand 11 states. [2018-11-07 10:51:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:51:58,921 INFO L93 Difference]: Finished difference Result 25251 states and 31131 transitions. [2018-11-07 10:51:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:51:58,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 199 [2018-11-07 10:51:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:51:58,969 INFO L225 Difference]: With dead ends: 25251 [2018-11-07 10:51:58,969 INFO L226 Difference]: Without dead ends: 13216 [2018-11-07 10:51:58,998 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:51:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13216 states. [2018-11-07 10:51:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13216 to 13208. [2018-11-07 10:51:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13208 states. [2018-11-07 10:51:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13208 states to 13208 states and 16141 transitions. [2018-11-07 10:51:59,335 INFO L78 Accepts]: Start accepts. Automaton has 13208 states and 16141 transitions. Word has length 199 [2018-11-07 10:51:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:51:59,335 INFO L480 AbstractCegarLoop]: Abstraction has 13208 states and 16141 transitions. [2018-11-07 10:51:59,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:51:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13208 states and 16141 transitions. [2018-11-07 10:51:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 10:51:59,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:51:59,366 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:51:59,366 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:51:59,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:51:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1458504401, now seen corresponding path program 1 times [2018-11-07 10:51:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:51:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:51:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:51:59,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:51:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:00,357 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 10:52:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 187 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:52:00,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:00,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:52:00,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-07 10:52:00,570 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [145], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:52:00,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:52:00,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:52:07,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:52:07,764 INFO L272 AbstractInterpreter]: Visited 86 different actions 680 times. Merged at 9 different actions 83 times. Widened at 1 different actions 4 times. Found 19 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:52:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:07,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:52:07,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:07,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:52:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:07,779 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:52:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:07,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:52:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-07 10:52:07,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:52:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-07 10:52:08,224 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:52:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 10:52:08,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:52:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:52:08,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:52:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:52:08,226 INFO L87 Difference]: Start difference. First operand 13208 states and 16141 transitions. Second operand 3 states. [2018-11-07 10:52:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:52:09,211 INFO L93 Difference]: Finished difference Result 28993 states and 35762 transitions. [2018-11-07 10:52:09,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:52:09,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-11-07 10:52:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:52:09,283 INFO L225 Difference]: With dead ends: 28993 [2018-11-07 10:52:09,284 INFO L226 Difference]: Without dead ends: 16550 [2018-11-07 10:52:09,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 428 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:52:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16550 states. [2018-11-07 10:52:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16550 to 16278. [2018-11-07 10:52:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16278 states. [2018-11-07 10:52:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16278 states to 16278 states and 19599 transitions. [2018-11-07 10:52:09,775 INFO L78 Accepts]: Start accepts. Automaton has 16278 states and 19599 transitions. Word has length 215 [2018-11-07 10:52:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:52:09,776 INFO L480 AbstractCegarLoop]: Abstraction has 16278 states and 19599 transitions. [2018-11-07 10:52:09,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:52:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16278 states and 19599 transitions. [2018-11-07 10:52:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 10:52:09,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:52:09,814 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:52:09,814 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:52:09,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 665445909, now seen corresponding path program 1 times [2018-11-07 10:52:09,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:52:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:09,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:09,816 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:52:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:10,828 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 10:52:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 189 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:52:10,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:10,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:52:10,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-11-07 10:52:10,889 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [153], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:52:10,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:52:10,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:52:17,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:52:17,954 INFO L272 AbstractInterpreter]: Visited 86 different actions 680 times. Merged at 9 different actions 83 times. Widened at 1 different actions 4 times. Found 19 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:52:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:17,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:52:17,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:17,961 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:52:17,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:17,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:52:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:18,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:52:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-07 10:52:18,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:52:18,460 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-11-07 10:52:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 169 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 10:52:18,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:52:18,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 10:52:18,956 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:52:18,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:52:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:52:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:52:18,957 INFO L87 Difference]: Start difference. First operand 16278 states and 19599 transitions. Second operand 12 states. [2018-11-07 10:52:20,412 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-07 10:52:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:52:23,848 INFO L93 Difference]: Finished difference Result 35254 states and 46697 transitions. [2018-11-07 10:52:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 10:52:23,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2018-11-07 10:52:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:52:23,937 INFO L225 Difference]: With dead ends: 35254 [2018-11-07 10:52:23,938 INFO L226 Difference]: Without dead ends: 16719 [2018-11-07 10:52:23,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=330, Invalid=1230, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:52:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16719 states. [2018-11-07 10:52:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16719 to 14499. [2018-11-07 10:52:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14499 states. [2018-11-07 10:52:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14499 states to 14499 states and 16750 transitions. [2018-11-07 10:52:24,496 INFO L78 Accepts]: Start accepts. Automaton has 14499 states and 16750 transitions. Word has length 217 [2018-11-07 10:52:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:52:24,497 INFO L480 AbstractCegarLoop]: Abstraction has 14499 states and 16750 transitions. [2018-11-07 10:52:24,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:52:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 14499 states and 16750 transitions. [2018-11-07 10:52:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-07 10:52:24,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:52:24,522 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:52:24,523 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:52:24,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -101145250, now seen corresponding path program 1 times [2018-11-07 10:52:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:52:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:24,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:52:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 78 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:52:24,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:24,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:52:24,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-07 10:52:24,876 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [153], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:52:24,878 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:52:24,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:52:31,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:52:31,853 INFO L272 AbstractInterpreter]: Visited 87 different actions 700 times. Merged at 10 different actions 95 times. Widened at 1 different actions 4 times. Found 25 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:52:31,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:31,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:52:31,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:31,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:52:31,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:31,870 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:52:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:31,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:52:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-07 10:52:32,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:52:32,275 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-11-07 10:52:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 207 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-11-07 10:52:32,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:52:32,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 10:52:32,487 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:52:32,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:52:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:52:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:52:32,488 INFO L87 Difference]: Start difference. First operand 14499 states and 16750 transitions. Second operand 12 states. [2018-11-07 10:52:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:52:35,440 INFO L93 Difference]: Finished difference Result 27720 states and 32220 transitions. [2018-11-07 10:52:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:52:35,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 234 [2018-11-07 10:52:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:52:35,477 INFO L225 Difference]: With dead ends: 27720 [2018-11-07 10:52:35,477 INFO L226 Difference]: Without dead ends: 13014 [2018-11-07 10:52:35,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:52:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13014 states. [2018-11-07 10:52:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13014 to 12171. [2018-11-07 10:52:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12171 states. [2018-11-07 10:52:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12171 states to 12171 states and 13884 transitions. [2018-11-07 10:52:35,821 INFO L78 Accepts]: Start accepts. Automaton has 12171 states and 13884 transitions. Word has length 234 [2018-11-07 10:52:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:52:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 12171 states and 13884 transitions. [2018-11-07 10:52:35,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:52:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 12171 states and 13884 transitions. [2018-11-07 10:52:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 10:52:35,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:52:35,838 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-07 10:52:35,838 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:52:35,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1062056222, now seen corresponding path program 1 times [2018-11-07 10:52:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:52:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:35,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:52:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 250 proven. 87 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-07 10:52:36,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:36,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:52:36,257 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-07 10:52:36,257 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [153], [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], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:52:36,259 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:52:36,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:52:45,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:52:45,380 INFO L272 AbstractInterpreter]: Visited 87 different actions 784 times. Merged at 10 different actions 104 times. Widened at 1 different actions 4 times. Found 28 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 10:52:45,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:45,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:52:45,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:45,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:52:45,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:45,394 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:52:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:45,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:52:46,311 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 10:52:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-07 10:52:46,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:52:46,669 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-11-07 10:52:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 216 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-07 10:52:46,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:52:46,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 10:52:46,957 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:52:46,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:52:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:52:46,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:52:46,958 INFO L87 Difference]: Start difference. First operand 12171 states and 13884 transitions. Second operand 12 states. [2018-11-07 10:52:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:52:49,886 INFO L93 Difference]: Finished difference Result 22248 states and 25261 transitions. [2018-11-07 10:52:49,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:52:49,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 243 [2018-11-07 10:52:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:52:49,911 INFO L225 Difference]: With dead ends: 22248 [2018-11-07 10:52:49,912 INFO L226 Difference]: Without dead ends: 9919 [2018-11-07 10:52:49,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:52:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2018-11-07 10:52:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 7409. [2018-11-07 10:52:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7409 states. [2018-11-07 10:52:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7409 states to 7409 states and 8020 transitions. [2018-11-07 10:52:50,112 INFO L78 Accepts]: Start accepts. Automaton has 7409 states and 8020 transitions. Word has length 243 [2018-11-07 10:52:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:52:50,113 INFO L480 AbstractCegarLoop]: Abstraction has 7409 states and 8020 transitions. [2018-11-07 10:52:50,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:52:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7409 states and 8020 transitions. [2018-11-07 10:52:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-07 10:52:50,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:52:50,122 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:52:50,122 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:52:50,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1984664234, now seen corresponding path program 1 times [2018-11-07 10:52:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:52:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:52:50,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:52:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:50,664 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 10:52:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 10:52:50,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:50,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:52:50,724 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-11-07 10:52:50,724 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:52:50,726 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:52:50,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:52:59,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:52:59,556 INFO L272 AbstractInterpreter]: Visited 87 different actions 768 times. Merged at 10 different actions 88 times. Widened at 1 different actions 4 times. Found 28 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:52:59,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:52:59,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:52:59,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:52:59,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:52:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:52:59,573 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:52:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:52:59,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:52:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 10:52:59,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:53:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 306 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 10:53:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:53:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2018-11-07 10:53:00,296 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:53:00,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:53:00,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:53:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:53:00,297 INFO L87 Difference]: Start difference. First operand 7409 states and 8020 transitions. Second operand 7 states. [2018-11-07 10:53:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:53:01,486 INFO L93 Difference]: Finished difference Result 14306 states and 15518 transitions. [2018-11-07 10:53:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:53:01,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2018-11-07 10:53:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:53:01,500 INFO L225 Difference]: With dead ends: 14306 [2018-11-07 10:53:01,500 INFO L226 Difference]: Without dead ends: 7666 [2018-11-07 10:53:01,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 543 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:53:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7666 states. [2018-11-07 10:53:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7666 to 7387. [2018-11-07 10:53:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7387 states. [2018-11-07 10:53:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7387 states to 7387 states and 7977 transitions. [2018-11-07 10:53:01,655 INFO L78 Accepts]: Start accepts. Automaton has 7387 states and 7977 transitions. Word has length 271 [2018-11-07 10:53:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:53:01,656 INFO L480 AbstractCegarLoop]: Abstraction has 7387 states and 7977 transitions. [2018-11-07 10:53:01,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:53:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7387 states and 7977 transitions. [2018-11-07 10:53:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-07 10:53:01,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:53:01,664 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 10:53:01,664 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:53:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:53:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 683096615, now seen corresponding path program 1 times [2018-11-07 10:53:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:53:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:53:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:53:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:53:01,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:53:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:53:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 391 proven. 141 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:53:02,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:53:02,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:53:02,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-11-07 10:53:02,824 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 10:53:02,826 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 10:53:02,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:53:18,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:53:18,207 INFO L272 AbstractInterpreter]: Visited 88 different actions 2166 times. Merged at 11 different actions 322 times. Widened at 1 different actions 19 times. Found 108 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 10:53:18,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:53:18,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:53:18,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:53:18,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:53:18,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:53:18,223 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:53:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:53:18,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:53:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-07 10:53:18,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:53:18,613 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 10:53:18,749 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 10:53:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-07 10:53:19,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:53:19,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 24 [2018-11-07 10:53:19,121 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:53:19,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:53:19,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:53:19,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:53:19,122 INFO L87 Difference]: Start difference. First operand 7387 states and 7977 transitions. Second operand 22 states. [2018-11-07 10:53:19,646 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 Received shutdown request... [2018-11-07 10:53:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:53:19,704 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:53:19,710 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:53:19,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:53:19 BoogieIcfgContainer [2018-11-07 10:53:19,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:53:19,711 INFO L168 Benchmark]: Toolchain (without parser) took 227249.67 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -941.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 10:53:19,712 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:53:19,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.60 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-11-07 10:53:19,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:53:19,714 INFO L168 Benchmark]: Boogie Preprocessor took 107.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-07 10:53:19,715 INFO L168 Benchmark]: RCFGBuilder took 3222.56 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: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:53:19,715 INFO L168 Benchmark]: TraceAbstraction took 223030.40 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -281.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 10:53:19,719 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.22 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 745.60 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 138.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3222.56 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: 120.8 MB). Peak memory consumption was 120.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223030.40 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -281.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 392]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 392). Cancelled while BasicCegarLoop was constructing difference of abstraction (7387states) and FLOYD_HOARE automaton (currently 8 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 222.9s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 108.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2670 SDtfs, 19495 SDslu, 3291 SDs, 0 SdLazy, 22903 SolverSat, 3562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.2s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 5284 GetRequests, 4895 SyntacticMatches, 21 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16278occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 80.8s AbstIntTime, 14 AbstIntIterations, 6 AbstIntStrong, 0.9968947818699418 AbsIntWeakeningRatio, 0.25934579439252337 AbsIntAvgWeakeningVarsNumRemoved, 25.636682242990656 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 7283 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 5354 NumberOfCodeBlocks, 5287 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7331 ConstructedInterpolants, 0 QuantifiedInterpolants, 5137182 SizeOfPredicates, 24 NumberOfNonLiveVariables, 5562 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 38 InterpolantComputations, 9 PerfectInterpolantSequences, 8318/9182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown