java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:12:18,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:12:18,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:12:18,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:12:18,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:12:18,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:12:18,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:12:18,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:12:18,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:12:18,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:12:18,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:12:18,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:12:18,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:12:18,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:12:18,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:12:18,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:12:18,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:12:18,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:12:18,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:12:18,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:12:18,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:12:18,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:12:18,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:12:18,744 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:12:18,744 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:12:18,745 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:12:18,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:12:18,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:12:18,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:12:18,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:12:18,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:12:18,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:12:18,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:12:18,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:12:18,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:12:18,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:12:18,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 16:12:18,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:12:18,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:12:18,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:12:18,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:12:18,771 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:12:18,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:12:18,771 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:12:18,772 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:12:18,772 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:12:18,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:12:18,772 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:12:18,773 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:12:18,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:12:18,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:12:18,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:12:18,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:12:18,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:12:18,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:12:18,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:12:18,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:12:18,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:12:18,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:12:18,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:12:18,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:12:18,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:12:18,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:12:18,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:12:18,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:12:18,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:12:18,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:12:18,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:12:18,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:12:18,778 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:12:18,778 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:12:18,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:12:18,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:12:18,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:12:18,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:12:18,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:12:18,840 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:12:18,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c [2018-11-12 16:12:18,901 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c81de26/340e28d1bbe542538879c2dd2a43065c/FLAG0f4dbb13a [2018-11-12 16:12:19,584 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:12:19,585 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c [2018-11-12 16:12:19,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c81de26/340e28d1bbe542538879c2dd2a43065c/FLAG0f4dbb13a [2018-11-12 16:12:19,623 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c81de26/340e28d1bbe542538879c2dd2a43065c [2018-11-12 16:12:19,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:12:19,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:12:19,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:12:19,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:12:19,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:12:19,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:19" (1/1) ... [2018-11-12 16:12:19,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1505abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:19, skipping insertion in model container [2018-11-12 16:12:19,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:12:19" (1/1) ... [2018-11-12 16:12:19,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:12:19,741 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:12:20,391 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:12:20,396 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:12:20,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:12:20,634 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:12:20,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20 WrapperNode [2018-11-12 16:12:20,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:12:20,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:12:20,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:12:20,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:12:20,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:12:20,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:12:20,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:12:20,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:12:20,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (1/1) ... [2018-11-12 16:12:20,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:12:20,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:12:20,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:12:20,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:12:20,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (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-12 16:12:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:12:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:12:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:12:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:12:21,020 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:12:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:12:21,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:12:21,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:12:21,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:12:25,268 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:12:25,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:25 BoogieIcfgContainer [2018-11-12 16:12:25,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:12:25,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:12:25,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:12:25,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:12:25,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:12:19" (1/3) ... [2018-11-12 16:12:25,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb360f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:25, skipping insertion in model container [2018-11-12 16:12:25,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:12:20" (2/3) ... [2018-11-12 16:12:25,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb360f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:12:25, skipping insertion in model container [2018-11-12 16:12:25,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:12:25" (3/3) ... [2018-11-12 16:12:25,280 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label29_false-unreach-call.c [2018-11-12 16:12:25,291 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:12:25,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:12:25,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:12:25,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:12:25,358 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:12:25,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:12:25,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:12:25,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:12:25,359 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:12:25,359 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:12:25,359 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:12:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-12 16:12:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 16:12:25,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:25,403 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] [2018-11-12 16:12:25,405 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:25,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1657837633, now seen corresponding path program 1 times [2018-11-12 16:12:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:25,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:25,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:25,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:25,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:25,915 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:12:25,941 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-12 16:12:25,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:12:25,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:12:25,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:25,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:12:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:12:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:12:25,972 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-11-12 16:12:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:28,536 INFO L93 Difference]: Finished difference Result 785 states and 1378 transitions. [2018-11-12 16:12:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:12:28,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-12 16:12:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:28,559 INFO L225 Difference]: With dead ends: 785 [2018-11-12 16:12:28,559 INFO L226 Difference]: Without dead ends: 490 [2018-11-12 16:12:28,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:12:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-11-12 16:12:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2018-11-12 16:12:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-11-12 16:12:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 841 transitions. [2018-11-12 16:12:28,661 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 841 transitions. Word has length 27 [2018-11-12 16:12:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:28,661 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 841 transitions. [2018-11-12 16:12:28,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:12:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 841 transitions. [2018-11-12 16:12:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-12 16:12:28,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:28,668 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 16:12:28,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1966736396, now seen corresponding path program 1 times [2018-11-12 16:12:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:28,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:12:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:12:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:12:28,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:28,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:12:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:12:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:12:28,986 INFO L87 Difference]: Start difference. First operand 482 states and 841 transitions. Second operand 6 states. [2018-11-12 16:12:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:34,394 INFO L93 Difference]: Finished difference Result 1761 states and 3209 transitions. [2018-11-12 16:12:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 16:12:34,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-12 16:12:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:34,409 INFO L225 Difference]: With dead ends: 1761 [2018-11-12 16:12:34,409 INFO L226 Difference]: Without dead ends: 1285 [2018-11-12 16:12:34,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:12:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-12 16:12:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1253. [2018-11-12 16:12:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-11-12 16:12:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1989 transitions. [2018-11-12 16:12:34,500 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1989 transitions. Word has length 97 [2018-11-12 16:12:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:34,500 INFO L480 AbstractCegarLoop]: Abstraction has 1253 states and 1989 transitions. [2018-11-12 16:12:34,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:12:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1989 transitions. [2018-11-12 16:12:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-12 16:12:34,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:34,505 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:12:34,505 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:34,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1683891539, now seen corresponding path program 1 times [2018-11-12 16:12:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:34,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:34,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:34,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:12:34,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:12:34,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:12:34,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:34,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:12:34,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:12:34,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:12:34,785 INFO L87 Difference]: Start difference. First operand 1253 states and 1989 transitions. Second operand 6 states. [2018-11-12 16:12:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:37,597 INFO L93 Difference]: Finished difference Result 3468 states and 5572 transitions. [2018-11-12 16:12:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:12:37,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-12 16:12:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:37,615 INFO L225 Difference]: With dead ends: 3468 [2018-11-12 16:12:37,615 INFO L226 Difference]: Without dead ends: 2221 [2018-11-12 16:12:37,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:12:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2018-11-12 16:12:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2196. [2018-11-12 16:12:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2018-11-12 16:12:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3228 transitions. [2018-11-12 16:12:37,697 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3228 transitions. Word has length 100 [2018-11-12 16:12:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:37,697 INFO L480 AbstractCegarLoop]: Abstraction has 2196 states and 3228 transitions. [2018-11-12 16:12:37,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:12:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3228 transitions. [2018-11-12 16:12:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 16:12:37,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:37,700 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:12:37,700 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:37,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 353905340, now seen corresponding path program 1 times [2018-11-12 16:12:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:37,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:37,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:38,356 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 16:12:38,641 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-12 16:12:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:12:38,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:12:38,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 16:12:38,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:38,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 16:12:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 16:12:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 16:12:38,695 INFO L87 Difference]: Start difference. First operand 2196 states and 3228 transitions. Second operand 7 states. [2018-11-12 16:12:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:43,835 INFO L93 Difference]: Finished difference Result 5912 states and 8935 transitions. [2018-11-12 16:12:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 16:12:43,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-12 16:12:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:43,859 INFO L225 Difference]: With dead ends: 5912 [2018-11-12 16:12:43,859 INFO L226 Difference]: Without dead ends: 3722 [2018-11-12 16:12:43,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-12 16:12:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-12 16:12:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3561. [2018-11-12 16:12:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2018-11-12 16:12:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4985 transitions. [2018-11-12 16:12:43,976 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4985 transitions. Word has length 101 [2018-11-12 16:12:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:43,977 INFO L480 AbstractCegarLoop]: Abstraction has 3561 states and 4985 transitions. [2018-11-12 16:12:43,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 16:12:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4985 transitions. [2018-11-12 16:12:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-12 16:12:43,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:43,980 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:12:43,980 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:43,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash 400123299, now seen corresponding path program 1 times [2018-11-12 16:12:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:43,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:43,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:12:44,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:12:44,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:12:44,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:44,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:12:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:12:44,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:12:44,126 INFO L87 Difference]: Start difference. First operand 3561 states and 4985 transitions. Second operand 3 states. [2018-11-12 16:12:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:12:47,075 INFO L93 Difference]: Finished difference Result 8038 states and 11661 transitions. [2018-11-12 16:12:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:12:47,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-11-12 16:12:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:12:47,103 INFO L225 Difference]: With dead ends: 8038 [2018-11-12 16:12:47,103 INFO L226 Difference]: Without dead ends: 4483 [2018-11-12 16:12:47,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12 16:12:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2018-11-12 16:12:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 4422. [2018-11-12 16:12:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2018-11-12 16:12:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 5858 transitions. [2018-11-12 16:12:47,226 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 5858 transitions. Word has length 159 [2018-11-12 16:12:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:12:47,227 INFO L480 AbstractCegarLoop]: Abstraction has 4422 states and 5858 transitions. [2018-11-12 16:12:47,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:12:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 5858 transitions. [2018-11-12 16:12:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-12 16:12:47,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:12:47,232 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:12:47,232 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:12:47,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1875107130, now seen corresponding path program 1 times [2018-11-12 16:12:47,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:12:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:47,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:12:47,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:12:47,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:12:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:12:47,662 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-12 16:12:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 16:12:47,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:12:47,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:12:47,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-12 16:12:47,707 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:12:47,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:12:47,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:12:48,670 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:12:50,131 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:12:50,136 INFO L272 AbstractInterpreter]: Visited 155 different actions 452 times. Merged at 5 different actions 9 times. Never widened. Performed 8507 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8507 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 16:12:50,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:12:50,181 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:12:51,201 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 73.69% of their original sizes. [2018-11-12 16:12:51,201 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:12:52,606 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-12 16:12:52,606 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:12:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:12:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2018-11-12 16:12:52,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:12:52,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 16:12:52,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 16:12:52,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-12 16:12:52,609 INFO L87 Difference]: Start difference. First operand 4422 states and 5858 transitions. Second operand 19 states. [2018-11-12 16:13:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:13:31,975 INFO L93 Difference]: Finished difference Result 9944 states and 13309 transitions. [2018-11-12 16:13:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 16:13:31,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 175 [2018-11-12 16:13:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:13:32,004 INFO L225 Difference]: With dead ends: 9944 [2018-11-12 16:13:32,004 INFO L226 Difference]: Without dead ends: 5528 [2018-11-12 16:13:32,027 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=374, Invalid=1606, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 16:13:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2018-11-12 16:13:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5385. [2018-11-12 16:13:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-12 16:13:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 6938 transitions. [2018-11-12 16:13:32,177 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 6938 transitions. Word has length 175 [2018-11-12 16:13:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:13:32,178 INFO L480 AbstractCegarLoop]: Abstraction has 5385 states and 6938 transitions. [2018-11-12 16:13:32,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 16:13:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 6938 transitions. [2018-11-12 16:13:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-12 16:13:32,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:13:32,184 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 16:13:32,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:13:32,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1839442868, now seen corresponding path program 1 times [2018-11-12 16:13:32,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:13:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:32,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:13:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:32,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:13:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:13:33,350 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 16:13:33,927 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 16:13:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:13:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:13:34,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:13:34,059 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-11-12 16:13:34,060 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:13:34,069 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:13:34,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:13:34,181 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:13:34,292 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:13:34,292 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Performed 3018 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3018 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 16:13:34,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:34,320 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:13:34,656 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.15% of their original sizes. [2018-11-12 16:13:34,656 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:13:34,978 INFO L415 sIntCurrentIteration]: We unified 217 AI predicates to 217 [2018-11-12 16:13:34,979 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:13:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:13:34,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-12 16:13:34,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:13:34,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 16:13:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 16:13:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 16:13:34,980 INFO L87 Difference]: Start difference. First operand 5385 states and 6938 transitions. Second operand 11 states. [2018-11-12 16:13:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:13:47,046 INFO L93 Difference]: Finished difference Result 9995 states and 13081 transitions. [2018-11-12 16:13:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 16:13:47,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2018-11-12 16:13:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:13:47,067 INFO L225 Difference]: With dead ends: 9995 [2018-11-12 16:13:47,068 INFO L226 Difference]: Without dead ends: 5579 [2018-11-12 16:13:47,083 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:13:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2018-11-12 16:13:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 5576. [2018-11-12 16:13:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5576 states. [2018-11-12 16:13:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 7149 transitions. [2018-11-12 16:13:47,204 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 7149 transitions. Word has length 218 [2018-11-12 16:13:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:13:47,205 INFO L480 AbstractCegarLoop]: Abstraction has 5576 states and 7149 transitions. [2018-11-12 16:13:47,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 16:13:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 7149 transitions. [2018-11-12 16:13:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-12 16:13:47,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:13:47,211 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:13:47,211 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:13:47,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2077276056, now seen corresponding path program 1 times [2018-11-12 16:13:47,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:13:47,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:47,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:13:47,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:47,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:13:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:13:47,710 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 16:13:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:13:48,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:13:48,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:13:48,221 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-11-12 16:13:48,221 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:13:48,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:13:48,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:13:48,300 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:13:48,540 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:13:48,540 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Performed 5092 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5092 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 16:13:48,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:48,549 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:13:48,820 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.15% of their original sizes. [2018-11-12 16:13:48,820 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:13:48,951 INFO L415 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2018-11-12 16:13:48,951 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:13:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:13:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-12 16:13:48,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:13:48,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 16:13:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 16:13:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 16:13:48,954 INFO L87 Difference]: Start difference. First operand 5576 states and 7149 transitions. Second operand 11 states. [2018-11-12 16:13:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:13:57,491 INFO L93 Difference]: Finished difference Result 11149 states and 14472 transitions. [2018-11-12 16:13:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 16:13:57,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2018-11-12 16:13:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:13:57,515 INFO L225 Difference]: With dead ends: 11149 [2018-11-12 16:13:57,515 INFO L226 Difference]: Without dead ends: 6158 [2018-11-12 16:13:57,532 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-12 16:13:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2018-11-12 16:13:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6151. [2018-11-12 16:13:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6151 states. [2018-11-12 16:13:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 7807 transitions. [2018-11-12 16:13:57,663 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 7807 transitions. Word has length 228 [2018-11-12 16:13:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:13:57,663 INFO L480 AbstractCegarLoop]: Abstraction has 6151 states and 7807 transitions. [2018-11-12 16:13:57,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 16:13:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 7807 transitions. [2018-11-12 16:13:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-12 16:13:57,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:13:57,668 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:13:57,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:13:57,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677592, now seen corresponding path program 1 times [2018-11-12 16:13:57,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:13:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:57,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:13:57,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:13:57,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:13:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:13:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-12 16:13:58,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:13:58,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:13:58,304 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-12 16:13:58,304 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:13:58,308 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:13:58,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:13:58,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:13:59,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:13:59,068 INFO L272 AbstractInterpreter]: Visited 141 different actions 550 times. Merged at 7 different actions 21 times. Never widened. Performed 8793 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8793 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-12 16:13:59,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:13:59,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:13:59,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:13:59,077 INFO L192 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-12 16:13:59,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:13:59,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:13:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:13:59,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:14:04,535 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-12 16:14:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-12 16:14:04,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:14:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:14:05,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:14:05,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-11-12 16:14:05,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:14:05,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 16:14:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 16:14:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-11-12 16:14:05,170 INFO L87 Difference]: Start difference. First operand 6151 states and 7807 transitions. Second operand 9 states. [2018-11-12 16:14:10,429 WARN L179 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-12 16:14:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:14:35,561 INFO L93 Difference]: Finished difference Result 17668 states and 24532 transitions. [2018-11-12 16:14:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 16:14:35,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2018-11-12 16:14:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:14:35,603 INFO L225 Difference]: With dead ends: 17668 [2018-11-12 16:14:35,603 INFO L226 Difference]: Without dead ends: 11909 [2018-11-12 16:14:35,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 454 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=154, Invalid=396, Unknown=2, NotChecked=0, Total=552 [2018-11-12 16:14:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11909 states. [2018-11-12 16:14:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11909 to 11784. [2018-11-12 16:14:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11784 states. [2018-11-12 16:14:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11784 states to 11784 states and 15632 transitions. [2018-11-12 16:14:35,877 INFO L78 Accepts]: Start accepts. Automaton has 11784 states and 15632 transitions. Word has length 229 [2018-11-12 16:14:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:14:35,877 INFO L480 AbstractCegarLoop]: Abstraction has 11784 states and 15632 transitions. [2018-11-12 16:14:35,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 16:14:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 11784 states and 15632 transitions. [2018-11-12 16:14:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-12 16:14:35,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:14:35,883 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:14:35,883 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:14:35,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:14:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253280, now seen corresponding path program 1 times [2018-11-12 16:14:35,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:14:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:14:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:14:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:14:35,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:14:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:14:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:14:36,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:14:36,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:14:36,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-11-12 16:14:36,737 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:14:36,743 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:14:36,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:14:36,830 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:14:37,214 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:14:37,214 INFO L272 AbstractInterpreter]: Visited 140 different actions 407 times. Merged at 5 different actions 9 times. Never widened. Performed 6252 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 16:14:37,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:14:37,221 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:14:37,625 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 73.2% of their original sizes. [2018-11-12 16:14:37,625 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:14:37,889 INFO L415 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2018-11-12 16:14:37,889 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:14:37,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:14:37,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 22 [2018-11-12 16:14:37,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:14:37,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 16:14:37,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 16:14:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 16:14:37,891 INFO L87 Difference]: Start difference. First operand 11784 states and 15632 transitions. Second operand 13 states. [2018-11-12 16:14:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:14:57,962 INFO L93 Difference]: Finished difference Result 21336 states and 28866 transitions. [2018-11-12 16:14:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 16:14:57,962 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2018-11-12 16:14:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:14:58,000 INFO L225 Difference]: With dead ends: 21336 [2018-11-12 16:14:58,000 INFO L226 Difference]: Without dead ends: 11988 [2018-11-12 16:14:58,027 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-11-12 16:14:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2018-11-12 16:14:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 11984. [2018-11-12 16:14:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11984 states. [2018-11-12 16:14:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11984 states to 11984 states and 15842 transitions. [2018-11-12 16:14:58,268 INFO L78 Accepts]: Start accepts. Automaton has 11984 states and 15842 transitions. Word has length 233 [2018-11-12 16:14:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:14:58,269 INFO L480 AbstractCegarLoop]: Abstraction has 11984 states and 15842 transitions. [2018-11-12 16:14:58,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 16:14:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11984 states and 15842 transitions. [2018-11-12 16:14:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-12 16:14:58,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:14:58,277 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:14:58,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:14:58,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:14:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1101765452, now seen corresponding path program 1 times [2018-11-12 16:14:58,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:14:58,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:14:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:14:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:14:58,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:14:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:14:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-12 16:14:58,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:14:58,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:14:58,780 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-11-12 16:14:58,780 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:14:58,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:14:58,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:14:58,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:14:59,318 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:14:59,318 INFO L272 AbstractInterpreter]: Visited 135 different actions 531 times. Merged at 7 different actions 24 times. Never widened. Performed 7598 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7598 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-12 16:14:59,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:14:59,324 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:15:00,260 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 74.26% of their original sizes. [2018-11-12 16:15:00,260 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:15:00,670 INFO L415 sIntCurrentIteration]: We unified 249 AI predicates to 249 [2018-11-12 16:15:00,671 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:15:00,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:15:00,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-12 16:15:00,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:15:00,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 16:15:00,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 16:15:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 16:15:00,674 INFO L87 Difference]: Start difference. First operand 11984 states and 15842 transitions. Second operand 21 states. [2018-11-12 16:15:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:15:23,976 INFO L93 Difference]: Finished difference Result 24706 states and 33421 transitions. [2018-11-12 16:15:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 16:15:23,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 250 [2018-11-12 16:15:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:15:24,034 INFO L225 Difference]: With dead ends: 24706 [2018-11-12 16:15:24,034 INFO L226 Difference]: Without dead ends: 14269 [2018-11-12 16:15:24,062 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 16:15:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14269 states. [2018-11-12 16:15:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14269 to 13854. [2018-11-12 16:15:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13854 states. [2018-11-12 16:15:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 18140 transitions. [2018-11-12 16:15:24,337 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 18140 transitions. Word has length 250 [2018-11-12 16:15:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:15:24,338 INFO L480 AbstractCegarLoop]: Abstraction has 13854 states and 18140 transitions. [2018-11-12 16:15:24,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 16:15:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 18140 transitions. [2018-11-12 16:15:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-12 16:15:24,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:15:24,348 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:15:24,348 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:15:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2078054716, now seen corresponding path program 1 times [2018-11-12 16:15:24,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:15:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:24,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:15:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 16:15:24,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:15:24,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:15:24,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:15:24,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:15:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:15:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:15:24,729 INFO L87 Difference]: Start difference. First operand 13854 states and 18140 transitions. Second operand 4 states. [2018-11-12 16:15:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:15:26,836 INFO L93 Difference]: Finished difference Result 32514 states and 45400 transitions. [2018-11-12 16:15:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:15:26,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2018-11-12 16:15:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:15:26,897 INFO L225 Difference]: With dead ends: 32514 [2018-11-12 16:15:26,897 INFO L226 Difference]: Without dead ends: 23170 [2018-11-12 16:15:26,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:15:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23170 states. [2018-11-12 16:15:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23170 to 23163. [2018-11-12 16:15:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23163 states. [2018-11-12 16:15:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23163 states to 23163 states and 30441 transitions. [2018-11-12 16:15:27,365 INFO L78 Accepts]: Start accepts. Automaton has 23163 states and 30441 transitions. Word has length 272 [2018-11-12 16:15:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:15:27,365 INFO L480 AbstractCegarLoop]: Abstraction has 23163 states and 30441 transitions. [2018-11-12 16:15:27,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:15:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23163 states and 30441 transitions. [2018-11-12 16:15:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-12 16:15:27,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:15:27,376 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:15:27,376 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:15:27,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:27,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1151299969, now seen corresponding path program 1 times [2018-11-12 16:15:27,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:15:27,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:27,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:27,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:27,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:15:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-12 16:15:28,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:15:28,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:15:28,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:15:28,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:15:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:15:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:15:28,062 INFO L87 Difference]: Start difference. First operand 23163 states and 30441 transitions. Second operand 3 states. [2018-11-12 16:15:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:15:29,225 INFO L93 Difference]: Finished difference Result 40869 states and 54529 transitions. [2018-11-12 16:15:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:15:29,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-11-12 16:15:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:15:29,277 INFO L225 Difference]: With dead ends: 40869 [2018-11-12 16:15:29,277 INFO L226 Difference]: Without dead ends: 22216 [2018-11-12 16:15:29,320 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-12 16:15:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22216 states. [2018-11-12 16:15:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22216 to 21938. [2018-11-12 16:15:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21938 states. [2018-11-12 16:15:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21938 states to 21938 states and 27949 transitions. [2018-11-12 16:15:29,707 INFO L78 Accepts]: Start accepts. Automaton has 21938 states and 27949 transitions. Word has length 298 [2018-11-12 16:15:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:15:29,708 INFO L480 AbstractCegarLoop]: Abstraction has 21938 states and 27949 transitions. [2018-11-12 16:15:29,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:15:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 21938 states and 27949 transitions. [2018-11-12 16:15:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-12 16:15:29,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:15:29,719 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:15:29,719 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:15:29,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1550488622, now seen corresponding path program 1 times [2018-11-12 16:15:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:15:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:29,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:15:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 222 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:15:30,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:30,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:15:30,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-12 16:15:30,539 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:15:30,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:15:30,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:15:30,620 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:15:31,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:15:31,030 INFO L272 AbstractInterpreter]: Visited 127 different actions 500 times. Merged at 8 different actions 28 times. Never widened. Performed 6958 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-12 16:15:31,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:31,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:15:31,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:31,037 INFO L192 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-12 16:15:31,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:31,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:15:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:31,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:15:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-12 16:15:31,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:15:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-12 16:15:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:15:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-11-12 16:15:32,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:15:32,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 16:15:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 16:15:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:15:32,139 INFO L87 Difference]: Start difference. First operand 21938 states and 27949 transitions. Second operand 18 states. [2018-11-12 16:15:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:15:45,000 INFO L93 Difference]: Finished difference Result 51225 states and 71760 transitions. [2018-11-12 16:15:45,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-12 16:15:45,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 303 [2018-11-12 16:15:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:15:45,143 INFO L225 Difference]: With dead ends: 51225 [2018-11-12 16:15:45,144 INFO L226 Difference]: Without dead ends: 32299 [2018-11-12 16:15:45,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 646 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1049, Invalid=4063, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 16:15:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32299 states. [2018-11-12 16:15:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32299 to 30746. [2018-11-12 16:15:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30746 states. [2018-11-12 16:15:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30746 states to 30746 states and 38589 transitions. [2018-11-12 16:15:45,893 INFO L78 Accepts]: Start accepts. Automaton has 30746 states and 38589 transitions. Word has length 303 [2018-11-12 16:15:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:15:45,894 INFO L480 AbstractCegarLoop]: Abstraction has 30746 states and 38589 transitions. [2018-11-12 16:15:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 16:15:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30746 states and 38589 transitions. [2018-11-12 16:15:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-12 16:15:45,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:15:45,904 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:15:45,904 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:15:45,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1420613007, now seen corresponding path program 1 times [2018-11-12 16:15:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:15:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:45,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:45,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:15:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 188 proven. 23 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-12 16:15:46,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:46,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:15:46,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-12 16:15:46,179 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:15:46,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:15:46,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:15:46,252 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:15:46,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:15:46,621 INFO L272 AbstractInterpreter]: Visited 127 different actions 501 times. Merged at 8 different actions 29 times. Never widened. Performed 6818 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6818 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-12 16:15:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:46,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:15:46,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:46,631 INFO L192 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-12 16:15:46,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:46,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:15:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:46,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:15:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-12 16:15:47,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:15:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-12 16:15:47,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:15:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2018-11-12 16:15:47,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:15:47,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 16:15:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 16:15:47,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-12 16:15:47,737 INFO L87 Difference]: Start difference. First operand 30746 states and 38589 transitions. Second operand 10 states. [2018-11-12 16:15:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:15:54,909 INFO L93 Difference]: Finished difference Result 71475 states and 93180 transitions. [2018-11-12 16:15:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 16:15:54,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 308 [2018-11-12 16:15:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:15:55,014 INFO L225 Difference]: With dead ends: 71475 [2018-11-12 16:15:55,015 INFO L226 Difference]: Without dead ends: 42464 [2018-11-12 16:15:55,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 638 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 16:15:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42464 states. [2018-11-12 16:15:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42464 to 40711. [2018-11-12 16:15:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40711 states. [2018-11-12 16:15:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40711 states to 40711 states and 50199 transitions. [2018-11-12 16:15:55,694 INFO L78 Accepts]: Start accepts. Automaton has 40711 states and 50199 transitions. Word has length 308 [2018-11-12 16:15:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:15:55,695 INFO L480 AbstractCegarLoop]: Abstraction has 40711 states and 50199 transitions. [2018-11-12 16:15:55,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 16:15:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 40711 states and 50199 transitions. [2018-11-12 16:15:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-12 16:15:55,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:15:55,711 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:15:55,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:15:55,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:15:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -41844962, now seen corresponding path program 1 times [2018-11-12 16:15:55,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:15:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:55,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:15:55,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:15:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 219 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 16:15:56,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:56,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:15:56,433 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-11-12 16:15:56,434 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-12 16:15:56,436 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:15:56,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:15:56,705 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-12 16:15:56,999 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-12 16:15:57,000 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-12 16:15:57,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 16:15:57,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:15:57,001 INFO L192 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-12 16:15:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:15:57,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:15:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:15:57,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:15:57,134 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 16:15:57,335 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:15:57,335 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 16:15:57,341 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 16:15:57,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:15:57 BoogieIcfgContainer [2018-11-12 16:15:57,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:15:57,342 INFO L168 Benchmark]: Toolchain (without parser) took 217705.02 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 849.6 MB. Max. memory is 7.1 GB. [2018-11-12 16:15:57,343 INFO L168 Benchmark]: CDTParser took 0.29 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-12 16:15:57,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 996.88 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 16:15:57,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 187.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2018-11-12 16:15:57,347 INFO L168 Benchmark]: Boogie Preprocessor took 108.45 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:15:57,347 INFO L168 Benchmark]: RCFGBuilder took 4336.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 178.0 MB). Peak memory consumption was 178.0 MB. Max. memory is 7.1 GB. [2018-11-12 16:15:57,348 INFO L168 Benchmark]: TraceAbstraction took 212070.86 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 715.6 MB. Max. memory is 7.1 GB. [2018-11-12 16:15:57,353 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.29 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 996.88 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 187.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.45 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4336.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 178.0 MB). Peak memory consumption was 178.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 212070.86 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.0 GB in the beginning and 3.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 715.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 316 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 211.9s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 177.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3328 SDtfs, 24084 SDslu, 4376 SDs, 0 SdLazy, 36240 SolverSat, 5168 SolverUnsat, 48 SolverUnknown, 0 SolverNotchecked, 90.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3104 GetRequests, 2790 SyntacticMatches, 13 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3058 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40711occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9973643872051517 AbsIntWeakeningRatio, 0.12283894449499545 AbsIntAvgWeakeningVarsNumRemoved, 21.1656050955414 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 4575 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 3838 NumberOfCodeBlocks, 3838 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4657 ConstructedInterpolants, 10 QuantifiedInterpolants, 5842452 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1547 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 2601/2964 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown