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/Problem14_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:34:51,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:34:51,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:34:51,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:34:51,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:34:51,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:34:51,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:34:51,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:34:51,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:34:51,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:34:51,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:34:51,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:34:51,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:34:51,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:34:51,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:34:51,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:34:51,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:34:51,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:34:51,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:34:51,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:34:51,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:34:51,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:34:51,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:34:51,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:34:51,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:34:51,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:34:51,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:34:51,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:34:51,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:34:51,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:34:51,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:34:51,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:34:51,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:34:51,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:34:51,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:34:51,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:34:51,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:34:51,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:34:51,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:34:51,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:34:51,821 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:34:51,821 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:34:51,822 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:34:51,822 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:34:51,822 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:34:51,822 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:34:51,822 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:34:51,823 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:34:51,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:34:51,823 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:34:51,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:34:51,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:34:51,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:34:51,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:34:51,828 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:34:51,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:34:51,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:34:51,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:34:51,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:34:51,830 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:34:51,830 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:34:51,830 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:34:51,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:34:51,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:34:51,831 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:34:51,831 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:34:51,831 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:34:51,831 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:34:51,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:34:51,833 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:34:51,833 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:34:51,833 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:34:51,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:34:51,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:34:51,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:34:51,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:34:51,898 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:34:51,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label17_true-unreach-call_false-termination.c [2018-11-07 20:34:51,969 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d21896/95e14ddab2144469a27e9107c7e1df4b/FLAG5b4ad9db9 [2018-11-07 20:34:52,571 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:34:52,572 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label17_true-unreach-call_false-termination.c [2018-11-07 20:34:52,595 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d21896/95e14ddab2144469a27e9107c7e1df4b/FLAG5b4ad9db9 [2018-11-07 20:34:52,616 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713d21896/95e14ddab2144469a27e9107c7e1df4b [2018-11-07 20:34:52,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:34:52,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:34:52,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:34:52,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:34:52,637 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:34:52,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:52" (1/1) ... [2018-11-07 20:34:52,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d4c212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:52, skipping insertion in model container [2018-11-07 20:34:52,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:34:52" (1/1) ... [2018-11-07 20:34:52,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:34:52,715 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:34:53,218 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:34:53,223 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:34:53,373 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:34:53,394 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:34:53,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53 WrapperNode [2018-11-07 20:34:53,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:34:53,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:34:53,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:34:53,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:34:53,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:34:53,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:34:53,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:34:53,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:34:53,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... [2018-11-07 20:34:53,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:34:53,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:34:53,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:34:53,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:34:53,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:34:53,741 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:34:53,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:34:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:34:53,741 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:34:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:34:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:34:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:34:53,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:34:53,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:34:57,155 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:34:57,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:57 BoogieIcfgContainer [2018-11-07 20:34:57,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:34:57,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:34:57,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:34:57,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:34:57,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:34:52" (1/3) ... [2018-11-07 20:34:57,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c37b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:57, skipping insertion in model container [2018-11-07 20:34:57,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:34:53" (2/3) ... [2018-11-07 20:34:57,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c37b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:34:57, skipping insertion in model container [2018-11-07 20:34:57,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:34:57" (3/3) ... [2018-11-07 20:34:57,166 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label17_true-unreach-call_false-termination.c [2018-11-07 20:34:57,178 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:34:57,191 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:34:57,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:34:57,252 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:34:57,252 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:34:57,252 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:34:57,252 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:34:57,253 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:34:57,253 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:34:57,253 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:34:57,253 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:34:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:34:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 20:34:57,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:57,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:57,305 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:57,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1535437935, now seen corresponding path program 1 times [2018-11-07 20:34:57,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:57,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:34:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:34:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:34:57,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:34:57,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:34:57,815 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:34:57,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:34:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:34:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:34:57,841 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:34:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:34:59,786 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:34:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:34:59,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-07 20:34:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:34:59,810 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:34:59,810 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:34:59,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:34:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:34:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:34:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:34:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 755 transitions. [2018-11-07 20:34:59,909 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 755 transitions. Word has length 63 [2018-11-07 20:34:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:34:59,910 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 755 transitions. [2018-11-07 20:34:59,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:34:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 755 transitions. [2018-11-07 20:34:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 20:34:59,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:34:59,919 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:34:59,920 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:34:59,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:34:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1025550080, now seen corresponding path program 1 times [2018-11-07 20:34:59,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:34:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:34:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:34:59,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:00,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:35:00,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:00,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:35:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:35:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:35:00,261 INFO L87 Difference]: Start difference. First operand 434 states and 755 transitions. Second operand 6 states. [2018-11-07 20:35:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:02,563 INFO L93 Difference]: Finished difference Result 1254 states and 2256 transitions. [2018-11-07 20:35:02,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:02,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-07 20:35:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:02,581 INFO L225 Difference]: With dead ends: 1254 [2018-11-07 20:35:02,581 INFO L226 Difference]: Without dead ends: 826 [2018-11-07 20:35:02,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:35:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-11-07 20:35:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 812. [2018-11-07 20:35:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-11-07 20:35:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1377 transitions. [2018-11-07 20:35:02,675 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1377 transitions. Word has length 143 [2018-11-07 20:35:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:02,676 INFO L480 AbstractCegarLoop]: Abstraction has 812 states and 1377 transitions. [2018-11-07 20:35:02,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:35:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1377 transitions. [2018-11-07 20:35:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 20:35:02,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:02,690 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:02,690 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:02,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1017512645, now seen corresponding path program 1 times [2018-11-07 20:35:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:02,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:02,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:02,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:03,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:03,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:35:03,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:03,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:35:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:35:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:35:03,085 INFO L87 Difference]: Start difference. First operand 812 states and 1377 transitions. Second operand 4 states. [2018-11-07 20:35:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:06,605 INFO L93 Difference]: Finished difference Result 1988 states and 3388 transitions. [2018-11-07 20:35:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:35:06,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-07 20:35:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:06,622 INFO L225 Difference]: With dead ends: 1988 [2018-11-07 20:35:06,623 INFO L226 Difference]: Without dead ends: 1182 [2018-11-07 20:35:06,631 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-07 20:35:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-11-07 20:35:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2018-11-07 20:35:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-11-07 20:35:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1751 transitions. [2018-11-07 20:35:06,678 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1751 transitions. Word has length 176 [2018-11-07 20:35:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:06,679 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1751 transitions. [2018-11-07 20:35:06,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:35:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1751 transitions. [2018-11-07 20:35:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 20:35:06,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:06,687 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:06,687 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:06,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash -234886452, now seen corresponding path program 1 times [2018-11-07 20:35:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:06,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:06,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:06,690 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:07,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:07,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:35:07,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:07,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:35:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:35:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:35:07,213 INFO L87 Difference]: Start difference. First operand 1182 states and 1751 transitions. Second operand 6 states. [2018-11-07 20:35:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:09,940 INFO L93 Difference]: Finished difference Result 3270 states and 4972 transitions. [2018-11-07 20:35:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 20:35:09,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2018-11-07 20:35:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:09,954 INFO L225 Difference]: With dead ends: 3270 [2018-11-07 20:35:09,954 INFO L226 Difference]: Without dead ends: 2094 [2018-11-07 20:35:09,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:35:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-11-07 20:35:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2013. [2018-11-07 20:35:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2018-11-07 20:35:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2916 transitions. [2018-11-07 20:35:10,028 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2916 transitions. Word has length 229 [2018-11-07 20:35:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:10,029 INFO L480 AbstractCegarLoop]: Abstraction has 2013 states and 2916 transitions. [2018-11-07 20:35:10,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:35:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2916 transitions. [2018-11-07 20:35:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-07 20:35:10,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:10,040 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:10,041 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:10,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -356461826, now seen corresponding path program 1 times [2018-11-07 20:35:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:10,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:10,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:10,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:10,592 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:35:10,824 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:35:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 195 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:11,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:11,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:11,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-11-07 20:35:11,585 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:11,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:11,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:12,778 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:12,781 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:12,782 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:12,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:12,828 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:13,865 INFO L227 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 78.16% of their original sizes. [2018-11-07 20:35:13,865 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:15,204 INFO L415 sIntCurrentIteration]: We unified 313 AI predicates to 313 [2018-11-07 20:35:15,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:15,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:15,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-07 20:35:15,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:15,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:35:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:35:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:35:15,208 INFO L87 Difference]: Start difference. First operand 2013 states and 2916 transitions. Second operand 21 states. [2018-11-07 20:35:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:53,339 INFO L93 Difference]: Finished difference Result 6449 states and 9313 transitions. [2018-11-07 20:35:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:35:53,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 314 [2018-11-07 20:35:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:53,361 INFO L225 Difference]: With dead ends: 6449 [2018-11-07 20:35:53,361 INFO L226 Difference]: Without dead ends: 4442 [2018-11-07 20:35:53,371 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 324 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-07 20:35:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2018-11-07 20:35:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4183. [2018-11-07 20:35:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2018-11-07 20:35:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5183 transitions. [2018-11-07 20:35:53,492 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5183 transitions. Word has length 314 [2018-11-07 20:35:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:53,493 INFO L480 AbstractCegarLoop]: Abstraction has 4183 states and 5183 transitions. [2018-11-07 20:35:53,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:35:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5183 transitions. [2018-11-07 20:35:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-07 20:35:53,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:53,509 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:35:53,510 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:53,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 964371846, now seen corresponding path program 1 times [2018-11-07 20:35:53,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:53,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:53,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:53,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:53,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 231 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:54,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:54,540 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:54,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2018-11-07 20:35:54,541 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [698], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:35:54,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:54,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:54,821 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:54,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:54,822 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:35:54,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:54,828 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:55,364 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 78% of their original sizes. [2018-11-07 20:35:55,364 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:56,773 INFO L415 sIntCurrentIteration]: We unified 349 AI predicates to 349 [2018-11-07 20:35:56,773 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:56,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [13] total 35 [2018-11-07 20:35:56,774 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:56,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 20:35:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 20:35:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:35:56,776 INFO L87 Difference]: Start difference. First operand 4183 states and 5183 transitions. Second operand 24 states. [2018-11-07 20:36:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:31,198 INFO L93 Difference]: Finished difference Result 8072 states and 10964 transitions. [2018-11-07 20:36:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:36:31,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 350 [2018-11-07 20:36:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:31,222 INFO L225 Difference]: With dead ends: 8072 [2018-11-07 20:36:31,222 INFO L226 Difference]: Without dead ends: 6254 [2018-11-07 20:36:31,232 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 360 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 20:36:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2018-11-07 20:36:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 5109. [2018-11-07 20:36:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2018-11-07 20:36:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 6139 transitions. [2018-11-07 20:36:31,348 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 6139 transitions. Word has length 350 [2018-11-07 20:36:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:31,349 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 6139 transitions. [2018-11-07 20:36:31,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 20:36:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 6139 transitions. [2018-11-07 20:36:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-11-07 20:36:31,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:31,368 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:36:31,368 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:31,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash -277912097, now seen corresponding path program 1 times [2018-11-07 20:36:31,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:31,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:31,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:31,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:31,885 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:32,076 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:36:32,282 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 207 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:32,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:32,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:32,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-11-07 20:36:32,963 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:32,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:32,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:33,238 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:33,239 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:33,239 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:33,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:33,243 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:34,271 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 78.17% of their original sizes. [2018-11-07 20:36:34,272 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:34,827 INFO L415 sIntCurrentIteration]: We unified 374 AI predicates to 374 [2018-11-07 20:36:34,828 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2018-11-07 20:36:34,828 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:34,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:36:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:36:34,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:36:34,830 INFO L87 Difference]: Start difference. First operand 5109 states and 6139 transitions. Second operand 20 states. [2018-11-07 20:36:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:56,509 INFO L93 Difference]: Finished difference Result 8873 states and 11740 transitions. [2018-11-07 20:36:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 20:36:56,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 375 [2018-11-07 20:36:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:56,536 INFO L225 Difference]: With dead ends: 8873 [2018-11-07 20:36:56,537 INFO L226 Difference]: Without dead ends: 7055 [2018-11-07 20:36:56,545 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-07 20:36:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7055 states. [2018-11-07 20:36:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7055 to 6031. [2018-11-07 20:36:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6031 states. [2018-11-07 20:36:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6031 states to 6031 states and 7093 transitions. [2018-11-07 20:36:56,678 INFO L78 Accepts]: Start accepts. Automaton has 6031 states and 7093 transitions. Word has length 375 [2018-11-07 20:36:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:56,679 INFO L480 AbstractCegarLoop]: Abstraction has 6031 states and 7093 transitions. [2018-11-07 20:36:56,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:36:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6031 states and 7093 transitions. [2018-11-07 20:36:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-07 20:36:56,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:56,700 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:36:56,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:56,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 107396146, now seen corresponding path program 1 times [2018-11-07 20:36:56,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:56,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:56,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:57,185 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:57,387 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:36:57,592 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:36:58,067 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 20:36:58,384 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-07 20:36:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 194 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:36:58,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:58,913 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:58,914 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-11-07 20:36:58,914 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:58,918 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:58,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:59,147 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:59,148 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:59,148 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:36:59,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:59,159 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:59,647 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 78.17% of their original sizes. [2018-11-07 20:36:59,648 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:00,325 INFO L415 sIntCurrentIteration]: We unified 387 AI predicates to 387 [2018-11-07 20:37:00,325 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:00,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:00,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [12] total 31 [2018-11-07 20:37:00,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:00,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:37:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:37:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:37:00,327 INFO L87 Difference]: Start difference. First operand 6031 states and 7093 transitions. Second operand 21 states. [2018-11-07 20:37:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:29,840 INFO L93 Difference]: Finished difference Result 9796 states and 12695 transitions. [2018-11-07 20:37:29,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 20:37:29,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 388 [2018-11-07 20:37:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:29,866 INFO L225 Difference]: With dead ends: 9796 [2018-11-07 20:37:29,866 INFO L226 Difference]: Without dead ends: 7978 [2018-11-07 20:37:29,876 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 397 GetRequests, 364 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-11-07 20:37:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2018-11-07 20:37:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 6953. [2018-11-07 20:37:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6953 states. [2018-11-07 20:37:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 8047 transitions. [2018-11-07 20:37:30,008 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 8047 transitions. Word has length 388 [2018-11-07 20:37:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:30,009 INFO L480 AbstractCegarLoop]: Abstraction has 6953 states and 8047 transitions. [2018-11-07 20:37:30,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:37:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 8047 transitions. [2018-11-07 20:37:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-07 20:37:30,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:30,031 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:37:30,032 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:30,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1887535862, now seen corresponding path program 1 times [2018-11-07 20:37:30,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:30,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:30,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 182 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:37:30,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:30,976 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:30,977 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-11-07 20:37:30,977 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:30,980 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:30,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:31,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:31,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:31,258 INFO L272 AbstractInterpreter]: Visited 179 different actions 354 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:31,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:31,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:31,669 INFO L227 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 78.16% of their original sizes. [2018-11-07 20:37:31,669 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:32,249 INFO L415 sIntCurrentIteration]: We unified 399 AI predicates to 399 [2018-11-07 20:37:32,249 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:32,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:32,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-07 20:37:32,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:32,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:37:32,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:37:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:37:32,253 INFO L87 Difference]: Start difference. First operand 6953 states and 8047 transitions. Second operand 21 states. [2018-11-07 20:37:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:51,341 INFO L93 Difference]: Finished difference Result 10839 states and 13827 transitions. [2018-11-07 20:37:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 20:37:51,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 400 [2018-11-07 20:37:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:51,363 INFO L225 Difference]: With dead ends: 10839 [2018-11-07 20:37:51,364 INFO L226 Difference]: Without dead ends: 9021 [2018-11-07 20:37:51,374 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 410 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-07 20:37:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9021 states. [2018-11-07 20:37:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9021 to 7875. [2018-11-07 20:37:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2018-11-07 20:37:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 9001 transitions. [2018-11-07 20:37:51,523 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 9001 transitions. Word has length 400 [2018-11-07 20:37:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:51,524 INFO L480 AbstractCegarLoop]: Abstraction has 7875 states and 9001 transitions. [2018-11-07 20:37:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:37:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 9001 transitions. [2018-11-07 20:37:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-11-07 20:37:51,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:51,551 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:51,552 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:51,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash 519519840, now seen corresponding path program 1 times [2018-11-07 20:37:51,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:51,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:51,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:51,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:51,554 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 256 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 20:37:52,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:52,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:52,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 426 with the following transitions: [2018-11-07 20:37:52,169 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:52,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:52,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:52,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:52,604 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:52,604 INFO L272 AbstractInterpreter]: Visited 175 different actions 523 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:37:52,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:52,612 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:53,240 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 77.39% of their original sizes. [2018-11-07 20:37:53,240 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:58,869 INFO L415 sIntCurrentIteration]: We unified 424 AI predicates to 424 [2018-11-07 20:37:58,870 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:58,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:58,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 20:37:58,870 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:58,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:37:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:37:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:37:58,872 INFO L87 Difference]: Start difference. First operand 7875 states and 9001 transitions. Second operand 17 states. [2018-11-07 20:38:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:23,726 INFO L93 Difference]: Finished difference Result 11623 states and 14335 transitions. [2018-11-07 20:38:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:38:23,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 425 [2018-11-07 20:38:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:23,748 INFO L225 Difference]: With dead ends: 11623 [2018-11-07 20:38:23,749 INFO L226 Difference]: Without dead ends: 8576 [2018-11-07 20:38:23,758 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 436 GetRequests, 243 SyntacticMatches, 166 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-07 20:38:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2018-11-07 20:38:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 7706. [2018-11-07 20:38:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7706 states. [2018-11-07 20:38:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 8892 transitions. [2018-11-07 20:38:23,886 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 8892 transitions. Word has length 425 [2018-11-07 20:38:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:23,887 INFO L480 AbstractCegarLoop]: Abstraction has 7706 states and 8892 transitions. [2018-11-07 20:38:23,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:38:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 8892 transitions. [2018-11-07 20:38:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-11-07 20:38:23,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:23,910 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:38:23,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:23,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash -576713123, now seen corresponding path program 1 times [2018-11-07 20:38:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:23,912 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:24,493 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-07 20:38:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 375 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:38:25,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:25,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:25,716 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 451 with the following transitions: [2018-11-07 20:38:25,717 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:25,719 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:25,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:25,872 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:26,075 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:26,075 INFO L272 AbstractInterpreter]: Visited 175 different actions 522 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:38:26,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:26,083 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:26,443 INFO L227 lantSequenceWeakener]: Weakened 447 states. On average, predicates are now at 80.51% of their original sizes. [2018-11-07 20:38:26,443 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:26,539 INFO L415 sIntCurrentIteration]: We unified 449 AI predicates to 449 [2018-11-07 20:38:26,539 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:26,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:26,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-07 20:38:26,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:26,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:38:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:38:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:38:26,541 INFO L87 Difference]: Start difference. First operand 7706 states and 8892 transitions. Second operand 10 states. [2018-11-07 20:38:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:31,364 INFO L93 Difference]: Finished difference Result 11976 states and 14479 transitions. [2018-11-07 20:38:31,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:38:31,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 450 [2018-11-07 20:38:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:31,380 INFO L225 Difference]: With dead ends: 11976 [2018-11-07 20:38:31,381 INFO L226 Difference]: Without dead ends: 8450 [2018-11-07 20:38:31,393 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 457 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:38:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8450 states. [2018-11-07 20:38:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8450 to 8430. [2018-11-07 20:38:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8430 states. [2018-11-07 20:38:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8430 states to 8430 states and 9754 transitions. [2018-11-07 20:38:31,535 INFO L78 Accepts]: Start accepts. Automaton has 8430 states and 9754 transitions. Word has length 450 [2018-11-07 20:38:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:31,536 INFO L480 AbstractCegarLoop]: Abstraction has 8430 states and 9754 transitions. [2018-11-07 20:38:31,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:38:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 8430 states and 9754 transitions. [2018-11-07 20:38:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-11-07 20:38:31,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:31,561 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 20:38:31,561 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:31,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2047477323, now seen corresponding path program 1 times [2018-11-07 20:38:31,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:31,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:31,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:31,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:32,076 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 20:38:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 528 proven. 175 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 20:38:33,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:33,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:33,190 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2018-11-07 20:38:33,190 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:33,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:33,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:33,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:34,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:38:34,213 INFO L272 AbstractInterpreter]: Visited 177 different actions 879 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:38:34,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:34,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:38:34,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:34,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:38:34,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:34,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:38:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:34,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:38:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 522 proven. 2 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-07 20:38:35,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:38:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 522 proven. 2 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-07 20:38:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:38:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-11-07 20:38:36,155 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:38:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:38:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:38:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:38:36,156 INFO L87 Difference]: Start difference. First operand 8430 states and 9754 transitions. Second operand 17 states. Received shutdown request... [2018-11-07 20:38:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 20:38:36,577 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 20:38:36,583 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 20:38:36,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:38:36 BoogieIcfgContainer [2018-11-07 20:38:36,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:38:36,585 INFO L168 Benchmark]: Toolchain (without parser) took 223954.21 ms. Allocated memory was 1.5 GB in the beginning and 4.9 GB in the end (delta: 3.4 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -279.5 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,585 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:38:36,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.99 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-07 20:38:36,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,588 INFO L168 Benchmark]: Boogie Preprocessor took 129.33 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-07 20:38:36,589 INFO L168 Benchmark]: RCFGBuilder took 3485.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 141.9 MB). Peak memory consumption was 141.9 MB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,589 INFO L168 Benchmark]: TraceAbstraction took 219426.70 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 360.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 20:38:36,593 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.99 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 145.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.33 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 3485.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 141.9 MB). Peak memory consumption was 141.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 219426.70 ms. Allocated memory was 2.3 GB in the beginning and 4.9 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 360.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 172]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 172). Cancelled while BasicCegarLoop was constructing difference of abstraction (8430states) and FLOYD_HOARE automaton (currently 5 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (30 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 219.3s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 183.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2108 SDtfs, 27371 SDslu, 2040 SDs, 0 SdLazy, 31270 SolverSat, 4518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.8s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 3861 GetRequests, 3453 SyntacticMatches, 180 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8430occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9978749134380164 AbsIntWeakeningRatio, 0.07198515769944341 AbsIntAvgWeakeningVarsNumRemoved, 13.67012987012987 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 5584 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4868 ConstructedInterpolants, 0 QuantifiedInterpolants, 20642633 SizeOfPredicates, 6 NumberOfNonLiveVariables, 781 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 4034/4675 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown