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/Problem01_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:06:46,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:06:46,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:06:46,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:06:46,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:06:46,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:06:46,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:06:46,902 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:06:46,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:06:46,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:06:46,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:06:46,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:06:46,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:06:46,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:06:46,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:06:46,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:06:46,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:06:46,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:06:46,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:06:46,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:06:46,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:06:46,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:06:46,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:06:46,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:06:46,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:06:46,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:06:46,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:06:46,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:06:46,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:06:46,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:06:46,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:06:46,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:06:46,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:06:46,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:06:46,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:06:46,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:06:46,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:06:46,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:06:46,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:06:46,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:06:46,968 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:06:46,968 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:06:46,968 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:06:46,969 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:06:46,969 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:06:46,969 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:06:46,969 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:06:46,969 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:06:46,970 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:06:46,970 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:06:46,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:06:46,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:06:46,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:06:46,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:06:46,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:06:46,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:06:46,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:06:46,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:06:46,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:06:46,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:06:46,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:06:46,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:06:46,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:06:46,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:06:46,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:06:46,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:06:46,974 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:06:47,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:06:47,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:06:47,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:06:47,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:06:47,047 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:06:47,048 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-12 17:06:47,120 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99d8a02f/c9d593a9575d49a484b22a5313155871/FLAG40b9f74b0 [2018-11-12 17:06:47,751 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:06:47,757 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2018-11-12 17:06:47,785 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99d8a02f/c9d593a9575d49a484b22a5313155871/FLAG40b9f74b0 [2018-11-12 17:06:47,804 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99d8a02f/c9d593a9575d49a484b22a5313155871 [2018-11-12 17:06:47,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:06:47,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:06:47,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:06:47,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:06:47,821 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:06:47,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:47" (1/1) ... [2018-11-12 17:06:47,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:47, skipping insertion in model container [2018-11-12 17:06:47,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:47" (1/1) ... [2018-11-12 17:06:47,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:06:47,902 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:06:48,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:06:48,377 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:06:48,514 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:06:48,540 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:06:48,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48 WrapperNode [2018-11-12 17:06:48,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:06:48,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:06:48,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:06:48,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:06:48,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:06:48,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:06:48,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:06:48,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:06:48,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... [2018-11-12 17:06:48,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:06:48,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:06:48,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:06:48,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:06:48,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:06:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:06:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:06:48,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:06:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:06:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:06:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:06:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:06:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:06:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:06:52,030 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:06:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:52 BoogieIcfgContainer [2018-11-12 17:06:52,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:06:52,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:06:52,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:06:52,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:06:52,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:06:47" (1/3) ... [2018-11-12 17:06:52,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24104e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:52, skipping insertion in model container [2018-11-12 17:06:52,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48" (2/3) ... [2018-11-12 17:06:52,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24104e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:52, skipping insertion in model container [2018-11-12 17:06:52,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:52" (3/3) ... [2018-11-12 17:06:52,040 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2018-11-12 17:06:52,050 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:06:52,061 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:06:52,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:06:52,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:06:52,124 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:06:52,124 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:06:52,124 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:06:52,124 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:06:52,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:06:52,125 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:06:52,125 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:06:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:06:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-12 17:06:52,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:06:52,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:06:52,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:06:52,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:06:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -200516955, now seen corresponding path program 1 times [2018-11-12 17:06:52,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:06:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:06:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:52,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:06:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:06:52,862 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:06:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:06:53,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:06:53,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:06:53,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:06:53,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:06:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:06:53,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:06:53,042 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:06:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:06:54,651 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:06:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:06:54,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-12 17:06:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:06:54,675 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:06:54,675 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:06:54,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:06:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:06:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:06:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:06:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-12 17:06:54,762 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 101 [2018-11-12 17:06:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:06:54,763 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-12 17:06:54,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:06:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-12 17:06:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 17:06:54,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:06:54,771 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:06:54,772 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:06:54,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:06:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1760831450, now seen corresponding path program 1 times [2018-11-12 17:06:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:06:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:06:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:54,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:06:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:06:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:06:54,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:06:54,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:06:54,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:06:54,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:06:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:06:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:06:54,972 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-12 17:06:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:06:56,602 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-12 17:06:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:06:56,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-12 17:06:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:06:56,612 INFO L225 Difference]: With dead ends: 888 [2018-11-12 17:06:56,612 INFO L226 Difference]: Without dead ends: 554 [2018-11-12 17:06:56,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:06:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-12 17:06:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-12 17:06:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-12 17:06:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-12 17:06:56,679 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 112 [2018-11-12 17:06:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:06:56,679 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-12 17:06:56,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:06:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-12 17:06:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 17:06:56,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:06:56,684 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:06:56,684 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:06:56,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:06:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1036914094, now seen corresponding path program 1 times [2018-11-12 17:06:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:06:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:06:56,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:56,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:06:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:06:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:06:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:06:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:06:56,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:06:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:06:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:06:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:06:56,907 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-12 17:06:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:06:57,979 INFO L93 Difference]: Finished difference Result 1530 states and 2432 transitions. [2018-11-12 17:06:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:06:57,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-11-12 17:06:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:06:57,996 INFO L225 Difference]: With dead ends: 1530 [2018-11-12 17:06:57,996 INFO L226 Difference]: Without dead ends: 997 [2018-11-12 17:06:58,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:06:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-12 17:06:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-12 17:06:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-12 17:06:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1488 transitions. [2018-11-12 17:06:58,065 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1488 transitions. Word has length 113 [2018-11-12 17:06:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:06:58,066 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1488 transitions. [2018-11-12 17:06:58,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:06:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1488 transitions. [2018-11-12 17:06:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 17:06:58,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:06:58,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:06:58,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:06:58,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:06:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash 790407278, now seen corresponding path program 1 times [2018-11-12 17:06:58,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:06:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:58,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:06:58,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:06:58,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:06:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:06:58,339 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:06:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:06:58,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:06:58,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:06:58,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:06:58,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:06:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:06:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:06:58,802 INFO L87 Difference]: Start difference. First operand 997 states and 1488 transitions. Second operand 6 states. [2018-11-12 17:07:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:02,145 INFO L93 Difference]: Finished difference Result 2927 states and 4616 transitions. [2018-11-12 17:07:02,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:07:02,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-12 17:07:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:02,159 INFO L225 Difference]: With dead ends: 2927 [2018-11-12 17:07:02,160 INFO L226 Difference]: Without dead ends: 1936 [2018-11-12 17:07:02,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:07:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-12 17:07:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1881. [2018-11-12 17:07:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2018-11-12 17:07:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 2656 transitions. [2018-11-12 17:07:02,246 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 2656 transitions. Word has length 127 [2018-11-12 17:07:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:02,247 INFO L480 AbstractCegarLoop]: Abstraction has 1881 states and 2656 transitions. [2018-11-12 17:07:02,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:07:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2656 transitions. [2018-11-12 17:07:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-12 17:07:02,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:02,255 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:02,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:02,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 323635751, now seen corresponding path program 1 times [2018-11-12 17:07:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:02,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:07:02,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:02,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:02,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-12 17:07:02,565 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:02,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:02,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:03,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:07:03,837 INFO L272 AbstractInterpreter]: Visited 105 different actions 170 times. Merged at 4 different actions 4 times. Never widened. Performed 2272 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:07:03,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:03,882 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:07:04,609 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.18% of their original sizes. [2018-11-12 17:07:04,609 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:07:05,572 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-12 17:07:05,573 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:07:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:07:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:07:05,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:05,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:07:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:07:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:07:05,576 INFO L87 Difference]: Start difference. First operand 1881 states and 2656 transitions. Second operand 11 states. [2018-11-12 17:07:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:19,726 INFO L93 Difference]: Finished difference Result 4979 states and 7062 transitions. [2018-11-12 17:07:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:07:19,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-11-12 17:07:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:19,741 INFO L225 Difference]: With dead ends: 4979 [2018-11-12 17:07:19,741 INFO L226 Difference]: Without dead ends: 3104 [2018-11-12 17:07:19,750 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:07:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-11-12 17:07:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3071. [2018-11-12 17:07:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2018-11-12 17:07:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3991 transitions. [2018-11-12 17:07:19,839 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3991 transitions. Word has length 145 [2018-11-12 17:07:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:19,840 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 3991 transitions. [2018-11-12 17:07:19,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:07:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3991 transitions. [2018-11-12 17:07:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-12 17:07:19,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:19,850 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:19,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:19,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1433340204, now seen corresponding path program 1 times [2018-11-12 17:07:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:19,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:20,389 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:07:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 17:07:20,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:20,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:20,575 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-11-12 17:07:20,576 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:20,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:20,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:21,100 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:07:21,100 INFO L272 AbstractInterpreter]: Visited 106 different actions 173 times. Merged at 5 different actions 5 times. Never widened. Performed 2678 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2678 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:07:21,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:21,142 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:07:21,671 INFO L227 lantSequenceWeakener]: Weakened 67 states. On average, predicates are now at 80.86% of their original sizes. [2018-11-12 17:07:21,672 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:07:22,424 INFO L415 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2018-11-12 17:07:22,424 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:07:22,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:07:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:07:22,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:22,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:07:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:07:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:07:22,427 INFO L87 Difference]: Start difference. First operand 3071 states and 3991 transitions. Second operand 19 states. [2018-11-12 17:07:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:42,484 INFO L93 Difference]: Finished difference Result 6421 states and 8375 transitions. [2018-11-12 17:07:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:07:42,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 158 [2018-11-12 17:07:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:42,500 INFO L225 Difference]: With dead ends: 6421 [2018-11-12 17:07:42,500 INFO L226 Difference]: Without dead ends: 3492 [2018-11-12 17:07:42,510 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:07:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2018-11-12 17:07:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3482. [2018-11-12 17:07:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2018-11-12 17:07:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4444 transitions. [2018-11-12 17:07:42,604 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4444 transitions. Word has length 158 [2018-11-12 17:07:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:42,604 INFO L480 AbstractCegarLoop]: Abstraction has 3482 states and 4444 transitions. [2018-11-12 17:07:42,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:07:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4444 transitions. [2018-11-12 17:07:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-12 17:07:42,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:42,616 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:07:42,616 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1278873057, now seen corresponding path program 1 times [2018-11-12 17:07:42,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:42,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:42,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:42,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 17:07:42,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:42,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:42,842 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-11-12 17:07:42,842 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:42,846 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:42,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:44,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:07:44,025 INFO L272 AbstractInterpreter]: Visited 108 different actions 399 times. Merged at 9 different actions 35 times. Never widened. Performed 6215 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:07:44,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:44,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:07:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:44,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:07:44,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:44,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:07:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:44,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:07:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 17:07:44,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:07:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 17:07:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:07:45,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-12 17:07:45,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:07:45,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:07:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:07:45,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:07:45,359 INFO L87 Difference]: Start difference. First operand 3482 states and 4444 transitions. Second operand 8 states. [2018-11-12 17:07:45,729 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:07:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:07:50,151 INFO L93 Difference]: Finished difference Result 12364 states and 17485 transitions. [2018-11-12 17:07:50,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:07:50,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-11-12 17:07:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:07:50,193 INFO L225 Difference]: With dead ends: 12364 [2018-11-12 17:07:50,193 INFO L226 Difference]: Without dead ends: 6710 [2018-11-12 17:07:50,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-12 17:07:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2018-11-12 17:07:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6549. [2018-11-12 17:07:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6549 states. [2018-11-12 17:07:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 7913 transitions. [2018-11-12 17:07:50,436 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 7913 transitions. Word has length 170 [2018-11-12 17:07:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:07:50,437 INFO L480 AbstractCegarLoop]: Abstraction has 6549 states and 7913 transitions. [2018-11-12 17:07:50,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:07:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 7913 transitions. [2018-11-12 17:07:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-12 17:07:50,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:07:50,454 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 17:07:50,454 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:07:50,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash 333501976, now seen corresponding path program 1 times [2018-11-12 17:07:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:07:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:07:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:07:50,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:07:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:07:50,992 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:07:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:07:51,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:07:51,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:07:51,178 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-11-12 17:07:51,178 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:07:51,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:07:51,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:07:51,579 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:07:51,579 INFO L272 AbstractInterpreter]: Visited 106 different actions 173 times. Merged at 5 different actions 5 times. Never widened. Performed 2865 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2865 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:07:51,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:07:51,584 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:07:52,522 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 80.68% of their original sizes. [2018-11-12 17:07:52,523 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:07:53,834 INFO L415 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-11-12 17:07:53,834 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:07:53,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:07:53,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-12 17:07:53,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:07:53,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 17:07:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 17:07:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:07:53,837 INFO L87 Difference]: Start difference. First operand 6549 states and 7913 transitions. Second operand 25 states. [2018-11-12 17:08:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:15,592 INFO L93 Difference]: Finished difference Result 13103 states and 15873 transitions. [2018-11-12 17:08:15,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:08:15,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 191 [2018-11-12 17:08:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:15,622 INFO L225 Difference]: With dead ends: 13103 [2018-11-12 17:08:15,623 INFO L226 Difference]: Without dead ends: 6759 [2018-11-12 17:08:15,644 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 161 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 17:08:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6759 states. [2018-11-12 17:08:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6759 to 6475. [2018-11-12 17:08:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6475 states. [2018-11-12 17:08:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6475 states to 6475 states and 7836 transitions. [2018-11-12 17:08:15,795 INFO L78 Accepts]: Start accepts. Automaton has 6475 states and 7836 transitions. Word has length 191 [2018-11-12 17:08:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:15,796 INFO L480 AbstractCegarLoop]: Abstraction has 6475 states and 7836 transitions. [2018-11-12 17:08:15,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 17:08:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6475 states and 7836 transitions. [2018-11-12 17:08:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-12 17:08:15,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:15,813 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:08:15,813 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:15,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2075133141, now seen corresponding path program 1 times [2018-11-12 17:08:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:15,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:15,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:08:16,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:16,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:16,150 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-11-12 17:08:16,151 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:16,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:16,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:17,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:08:17,384 INFO L272 AbstractInterpreter]: Visited 108 different actions 501 times. Merged at 9 different actions 42 times. Never widened. Performed 8059 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8059 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:08:17,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:17,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:08:17,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:17,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:08:17,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:17,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:08:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:17,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:08:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 17:08:17,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:08:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:08:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:08:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:08:17,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:08:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:08:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:08:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:08:17,732 INFO L87 Difference]: Start difference. First operand 6475 states and 7836 transitions. Second operand 11 states. [2018-11-12 17:08:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:19,825 INFO L93 Difference]: Finished difference Result 14499 states and 17625 transitions. [2018-11-12 17:08:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:08:19,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-11-12 17:08:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:19,860 INFO L225 Difference]: With dead ends: 14499 [2018-11-12 17:08:19,860 INFO L226 Difference]: Without dead ends: 8229 [2018-11-12 17:08:19,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:08:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2018-11-12 17:08:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8059. [2018-11-12 17:08:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8059 states. [2018-11-12 17:08:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8059 states to 8059 states and 9552 transitions. [2018-11-12 17:08:20,093 INFO L78 Accepts]: Start accepts. Automaton has 8059 states and 9552 transitions. Word has length 200 [2018-11-12 17:08:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:20,093 INFO L480 AbstractCegarLoop]: Abstraction has 8059 states and 9552 transitions. [2018-11-12 17:08:20,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:08:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8059 states and 9552 transitions. [2018-11-12 17:08:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 17:08:20,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:20,114 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:08:20,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:20,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 573609443, now seen corresponding path program 1 times [2018-11-12 17:08:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:20,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:20,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:08:20,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:20,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:20,585 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-12 17:08:20,586 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:20,588 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:20,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:21,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:21,403 INFO L272 AbstractInterpreter]: Visited 107 different actions 280 times. Merged at 7 different actions 14 times. Never widened. Performed 4253 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4253 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:08:21,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:21,435 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:21,893 INFO L227 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 80.18% of their original sizes. [2018-11-12 17:08:21,894 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:22,050 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-11-12 17:08:22,050 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:08:22,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:22,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:08:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:08:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:08:22,052 INFO L87 Difference]: Start difference. First operand 8059 states and 9552 transitions. Second operand 11 states. [2018-11-12 17:08:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:28,531 INFO L93 Difference]: Finished difference Result 15917 states and 18917 transitions. [2018-11-12 17:08:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:08:28,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2018-11-12 17:08:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:28,555 INFO L225 Difference]: With dead ends: 15917 [2018-11-12 17:08:28,556 INFO L226 Difference]: Without dead ends: 8201 [2018-11-12 17:08:28,569 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:08:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2018-11-12 17:08:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8197. [2018-11-12 17:08:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8197 states. [2018-11-12 17:08:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 9700 transitions. [2018-11-12 17:08:28,750 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 9700 transitions. Word has length 209 [2018-11-12 17:08:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:28,751 INFO L480 AbstractCegarLoop]: Abstraction has 8197 states and 9700 transitions. [2018-11-12 17:08:28,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:08:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 9700 transitions. [2018-11-12 17:08:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-12 17:08:28,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:28,772 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:08:28,772 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:28,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash -771761084, now seen corresponding path program 1 times [2018-11-12 17:08:28,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:28,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:28,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:28,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:08:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:29,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:29,182 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-12 17:08:29,183 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:29,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:29,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:29,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:29,551 INFO L272 AbstractInterpreter]: Visited 106 different actions 173 times. Merged at 5 different actions 5 times. Never widened. Performed 2931 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2931 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:08:29,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:29,555 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:29,942 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 79.81% of their original sizes. [2018-11-12 17:08:29,943 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:30,229 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-11-12 17:08:30,229 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:30,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:08:30,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:08:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:08:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:08:30,231 INFO L87 Difference]: Start difference. First operand 8197 states and 9700 transitions. Second operand 18 states. [2018-11-12 17:08:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:39,408 INFO L93 Difference]: Finished difference Result 16188 states and 19217 transitions. [2018-11-12 17:08:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:08:39,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 213 [2018-11-12 17:08:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:39,432 INFO L225 Difference]: With dead ends: 16188 [2018-11-12 17:08:39,432 INFO L226 Difference]: Without dead ends: 8472 [2018-11-12 17:08:39,446 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-11-12 17:08:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2018-11-12 17:08:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8471. [2018-11-12 17:08:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8471 states. [2018-11-12 17:08:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8471 states to 8471 states and 9998 transitions. [2018-11-12 17:08:39,630 INFO L78 Accepts]: Start accepts. Automaton has 8471 states and 9998 transitions. Word has length 213 [2018-11-12 17:08:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:39,631 INFO L480 AbstractCegarLoop]: Abstraction has 8471 states and 9998 transitions. [2018-11-12 17:08:39,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:08:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8471 states and 9998 transitions. [2018-11-12 17:08:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-12 17:08:39,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:39,655 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 17:08:39,655 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:39,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1837564599, now seen corresponding path program 1 times [2018-11-12 17:08:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:39,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:39,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:39,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:39,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 120 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:08:40,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:40,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:40,237 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-11-12 17:08:40,237 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:40,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:40,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:41,098 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:08:41,098 INFO L272 AbstractInterpreter]: Visited 107 different actions 283 times. Merged at 7 different actions 17 times. Never widened. Performed 4276 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:08:41,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:41,107 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:08:41,479 INFO L227 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 80.17% of their original sizes. [2018-11-12 17:08:41,479 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:08:41,596 INFO L415 sIntCurrentIteration]: We unified 221 AI predicates to 221 [2018-11-12 17:08:41,596 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:08:41,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:08:41,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-12 17:08:41,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:08:41,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:08:41,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:08:41,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:08:41,598 INFO L87 Difference]: Start difference. First operand 8471 states and 9998 transitions. Second operand 10 states. [2018-11-12 17:08:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:47,450 INFO L93 Difference]: Finished difference Result 15857 states and 18781 transitions. [2018-11-12 17:08:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:08:47,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-11-12 17:08:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:47,473 INFO L225 Difference]: With dead ends: 15857 [2018-11-12 17:08:47,473 INFO L226 Difference]: Without dead ends: 9177 [2018-11-12 17:08:47,486 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:08:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9177 states. [2018-11-12 17:08:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9177 to 9164. [2018-11-12 17:08:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-11-12 17:08:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 10760 transitions. [2018-11-12 17:08:47,992 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 10760 transitions. Word has length 222 [2018-11-12 17:08:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:47,993 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 10760 transitions. [2018-11-12 17:08:47,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:08:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 10760 transitions. [2018-11-12 17:08:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-12 17:08:48,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:08:48,014 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-12 17:08:48,014 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:08:48,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 248560561, now seen corresponding path program 1 times [2018-11-12 17:08:48,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:08:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:48,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:48,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:08:48,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:08:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:48,987 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:08:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:08:49,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:49,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:08:49,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-12 17:08:49,229 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:08:49,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:08:49,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:08:52,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:08:52,488 INFO L272 AbstractInterpreter]: Visited 108 different actions 1269 times. Merged at 9 different actions 130 times. Widened at 1 different actions 8 times. Performed 19396 root evaluator evaluations with a maximum evaluation depth of 6. Performed 19396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 31 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:08:52,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:08:52,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:08:52,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:08:52,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:08:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:08:52,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:08:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:08:52,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:08:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:08:52,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:08:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:08:53,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:08:53,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-12 17:08:53,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:08:53,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:08:53,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:08:53,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:08:53,382 INFO L87 Difference]: Start difference. First operand 9164 states and 10760 transitions. Second operand 11 states. [2018-11-12 17:08:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:08:57,283 INFO L93 Difference]: Finished difference Result 17318 states and 21512 transitions. [2018-11-12 17:08:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 17:08:57,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-11-12 17:08:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:08:57,290 INFO L225 Difference]: With dead ends: 17318 [2018-11-12 17:08:57,290 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:08:57,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 468 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:08:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:08:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:08:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:08:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:08:57,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2018-11-12 17:08:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:08:57,327 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:08:57,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:08:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:08:57,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:08:57,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:08:57,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:58,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,138 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 414 DAG size of output: 335 [2018-11-12 17:08:59,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:08:59,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:00,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:00,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:09:00,059 WARN L179 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 393 DAG size of output: 311 [2018-11-12 17:09:01,150 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-12 17:09:03,681 WARN L179 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 148 DAG size of output: 86 [2018-11-12 17:09:10,808 WARN L179 SmtUtils]: Spent 7.10 s on a formula simplification. DAG size of input: 391 DAG size of output: 192 [2018-11-12 17:09:12,988 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 355 DAG size of output: 112 [2018-11-12 17:09:14,635 WARN L179 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 334 DAG size of output: 116 [2018-11-12 17:09:14,640 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:09:14,640 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-12 17:09:14,640 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,641 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:09:14,642 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:09:14,643 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:09:14,644 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:09:14,645 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:09:14,646 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:09:14,647 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:09:14,648 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,649 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:09:14,650 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,651 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:09:14,652 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:09:14,653 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:09:14,654 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:09:14,654 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:09:14,654 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:09:14,654 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:09:14,654 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse37 (= 1 |old(~a7~0)|)) (.cse28 (= 1 ~a7~0)) (.cse34 (= 4 |old(~a16~0)|)) (.cse38 (= |old(~a20~0)| ~a20~0)) (.cse39 (<= ~a21~0 |old(~a21~0)|)) (.cse23 (= |old(~a16~0)| ~a16~0)) (.cse19 (= ~a17~0 1)) (.cse21 (= ~a7~0 |old(~a7~0)|)) (.cse22 (= |old(~a8~0)| ~a8~0)) (.cse1 (= ~a17~0 0)) (.cse0 (= ~a21~0 1))) (let ((.cse10 (< |old(~a20~0)| 0)) (.cse16 (not (= 5 |old(~a16~0)|))) (.cse14 (< 13 |old(~a8~0)|)) (.cse2 (not (= 0 |old(~a7~0)|))) (.cse7 (not (= 0 |old(~a17~0)|))) (.cse18 (and .cse1 .cse0)) (.cse6 (not (= 15 |old(~a8~0)|))) (.cse3 (not (= 1 |old(~a21~0)|))) (.cse24 (< 15 |old(~a8~0)|)) (.cse33 (and .cse23 .cse19 .cse0 .cse21 .cse22 (= ~a20~0 1))) (.cse4 (not (= 8 ~a12~0))) (.cse17 (not (= 1 |old(~a17~0)|))) (.cse31 (< 5 |old(~a16~0)|)) (.cse32 (< |old(~a16~0)| 4)) (.cse26 (< |old(~a8~0)| 13)) (.cse30 (< |old(~a8~0)| 15)) (.cse15 (< 0 |old(~a21~0)|)) (.cse5 (not (= 1 |old(~a20~0)|))) (.cse13 (and .cse38 .cse21 .cse22 .cse39 (= ~a16~0 |old(~a16~0)|))) (.cse12 (< |calculate_output_#in~input| 1)) (.cse8 (< 6 |calculate_output_#in~input|)) (.cse25 (< 1 |old(~a7~0)|)) (.cse27 (< |old(~a7~0)| 0)) (.cse9 (not .cse34)) (.cse20 (= 6 |old(~a16~0)|)) (.cse36 (and .cse28 .cse22 .cse38 .cse39 .cse23)) (.cse35 (= 13 |old(~a8~0)|)) (.cse29 (not .cse37)) (.cse11 (< 0 |old(~a20~0)|))) (and (or (and .cse0 .cse1) (or .cse2 .cse3 .cse4 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse5 .cse6 .cse7)) (or .cse8 .cse2 .cse3 .cse9 .cse4 (< 1 |old(~a17~0)|) .cse10 .cse6 (and (<= 0 ~a17~0) .cse0 (<= ~a17~0 1)) (< |old(~a17~0)| 0) .cse11 .cse12) (or .cse13 .cse14 .cse5 .cse15) (or .cse8 (and (or .cse2 .cse3 .cse6 .cse7 (not (= 0 |old(~a20~0)|)) .cse16 .cse4) (or .cse2 .cse3 .cse6 .cse16 .cse4 (< 1 |old(~a20~0)|) .cse10 .cse17)) (or .cse18 (and .cse19 .cse0)) .cse12) (or .cse20 (= |old(~a7~0)| 1) .cse14 (and .cse21 .cse22 .cse23)) (or .cse8 .cse3 .cse24 .cse9 .cse4 .cse17 .cse5 (and .cse0 .cse19) .cse25 .cse26 .cse27 .cse12) (or (and .cse28 .cse22 .cse23) .cse29 .cse30) (or .cse8 .cse19 (or .cse2 .cse3 .cse4 .cse10 .cse17 .cse6 .cse16 .cse11) .cse12) (or .cse8 .cse3 .cse14 .cse4 .cse17 .cse5 .cse31 .cse32 .cse25 .cse26 .cse33 .cse27 .cse12) (or .cse8 .cse9 (or .cse2 .cse3 .cse7 .cse4) .cse18 .cse5 .cse6 .cse12) (or .cse8 .cse3 .cse24 .cse33 .cse4 .cse17 .cse5 .cse31 .cse32 .cse29 .cse26 .cse12) (or .cse20 .cse34 .cse5 .cse35 .cse13) (or .cse5 (= 1 ~a20~0) .cse30) (or .cse20 .cse29 .cse36 .cse15 .cse11) (or .cse37 .cse35 (and .cse21 .cse22 .cse38 .cse39 .cse23) .cse11) (or .cse37 .cse5 .cse13) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) .cse19 (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse12 .cse8 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) .cse25 (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) .cse27 (not (= 6 ~f~0))) (or .cse37 (and .cse38 .cse39) .cse9 .cse11) (or .cse20 .cse36 .cse35 .cse29 .cse11)))) [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,655 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:09:14,656 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,657 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:09:14,658 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,659 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:09:14,660 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:09:14,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:09:14,661 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:09:14,661 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:09:14,661 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:09:14,661 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:09:14,661 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:09:14,662 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse4 (<= ~a20~0 0)) (.cse7 (= 1 ~a7~0)) (.cse2 (<= ~a8~0 13)) (.cse8 (<= ~a21~0 0)) (.cse1 (= 1 ~a20~0)) (.cse3 (not (= ~a16~0 6))) (.cse5 (not (= ~a8~0 13))) (.cse6 (= ~a16~0 4))) (or (and .cse0 .cse1) (and (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a16~0 5) (= ~a17~0 1) (= ~a21~0 1) (<= ~a8~0 15) (<= 13 ~a8~0) (<= 4 ~a16~0) (= ~a20~0 1)) (and .cse2 (= ~a7~0 |old(~a7~0)|) .cse3) (and .cse3 .cse4 .cse5) (not (= 3 ~c~0)) (and .cse0 .cse6 .cse4) (and .cse0 .cse5 .cse4) (and .cse7 .cse8 .cse3 .cse4) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse7 (<= 15 ~a8~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 .cse8 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse1 .cse3 .cse5 (not .cse6)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-12 17:09:14,662 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:09:14,662 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:09:14,662 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:09:14,662 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a7~0 1))) (.cse4 (<= ~a20~0 0)) (.cse7 (= 1 ~a7~0)) (.cse2 (<= ~a8~0 13)) (.cse8 (<= ~a21~0 0)) (.cse1 (= 1 ~a20~0)) (.cse3 (not (= ~a16~0 6))) (.cse5 (not (= ~a8~0 13))) (.cse6 (= ~a16~0 4)) (.cse9 (<= ~a8~0 |old(~a8~0)|))) (or (and .cse0 .cse1) (and .cse2 (= ~a7~0 |old(~a7~0)|) .cse3) (and .cse3 .cse4 .cse5) (not (= 3 ~c~0)) (and .cse0 .cse6 .cse4) (and .cse0 .cse5 .cse4) (and .cse7 .cse8 .cse3 .cse4) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (and .cse9 .cse7 (<= 15 ~a8~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 .cse8 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse1 .cse3 .cse5 (not .cse6)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and (<= ~a16~0 5) (= ~a17~0 1) (= ~a21~0 1) .cse9 (<= 13 ~a8~0) (<= 4 ~a16~0) (= ~a20~0 1)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-12 17:09:14,662 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:09:14,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:09:14 BoogieIcfgContainer [2018-11-12 17:09:14,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:09:14,678 INFO L168 Benchmark]: Toolchain (without parser) took 146861.82 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,679 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:09:14,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,681 INFO L168 Benchmark]: Boogie Preprocessor took 106.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,682 INFO L168 Benchmark]: RCFGBuilder took 3248.54 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: 116.1 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,683 INFO L168 Benchmark]: TraceAbstraction took 142644.72 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -707.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:09:14,688 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.26 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 724.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3248.54 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: 116.1 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142644.72 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -707.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(a7 == 1) && 1 == a20) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || ((!(a16 == 6) && a20 <= 0) && !(a8 == 13))) || !(3 == c)) || ((!(a7 == 1) && a16 == 4) && a20 <= 0)) || ((!(a7 == 1) && !(a8 == 13)) && a20 <= 0)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a20 <= 0)) || !(1 == \old(a21))) || !(4 == d)) || !(2 == b)) || ((a8 <= \old(a8) && 1 == a7) && 15 <= a8)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((a8 <= 13 && a21 <= 0) && 1 == a20)) || !(21 == u)) || !(22 == v)) || (((1 == a20 && !(a16 == 6)) && !(a8 == 13)) && !(a16 == 4))) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || ((((((a16 <= 5 && a17 == 1) && a21 == 1) && a8 <= \old(a8)) && 13 <= a8) && 4 <= a16) && a20 == 1)) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 142.5s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 96.4s AutomataDifference, 0.0s DeadEndRemovalTime, 17.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1862 SDtfs, 13061 SDslu, 2741 SDs, 0 SdLazy, 19290 SolverSat, 2523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2544 GetRequests, 2277 SyntacticMatches, 15 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1734 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9164occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.0s AbstIntTime, 9 AbstIntIterations, 6 AbstIntStrong, 0.9969493694799259 AbsIntWeakeningRatio, 0.2226148409893993 AbsIntAvgWeakeningVarsNumRemoved, 27.416077738515902 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 746 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 526 PreInvPairs, 842 NumberOfFragments, 1377 HoareAnnotationTreeSize, 526 FomulaSimplifications, 17398 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22077 FormulaSimplificationTreeSizeReductionInter, 14.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3357 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339501 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1753 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 2240/2551 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...