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/Problem02_label36_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:14:49,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:14:49,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:14:49,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:14:49,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:14:49,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:14:49,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:14:49,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:14:49,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:14:49,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:14:49,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:14:49,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:14:49,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:14:49,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:14:49,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:14:49,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:14:49,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:14:49,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:14:49,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:14:49,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:14:49,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:14:49,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:14:49,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:14:49,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:14:49,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:14:49,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:14:49,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:14:49,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:14:49,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:14:49,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:14:49,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:14:49,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:14:49,084 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:14:49,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:14:49,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:14:49,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:14:49,088 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:14:49,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:14:49,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:14:49,104 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:14:49,104 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:14:49,105 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:14:49,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:14:49,105 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:14:49,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:14:49,105 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:14:49,105 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:14:49,106 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:14:49,106 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:14:49,106 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:14:49,107 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:14:49,107 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:14:49,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:14:49,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:14:49,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:14:49,108 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:14:49,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:14:49,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:14:49,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:14:49,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:14:49,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:14:49,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:14:49,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:14:49,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:14:49,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:14:49,110 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:14:49,110 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:14:49,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:14:49,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:14:49,110 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:14:49,111 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:14:49,111 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:14:49,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:14:49,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:14:49,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:14:49,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:14:49,171 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:14:49,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-12 17:14:49,234 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24c563a3/c29384801b524d3a9bbf3264323a67c4/FLAGb00fe40e7 [2018-11-12 17:14:49,837 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:14:49,838 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-12 17:14:49,852 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24c563a3/c29384801b524d3a9bbf3264323a67c4/FLAGb00fe40e7 [2018-11-12 17:14:49,868 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24c563a3/c29384801b524d3a9bbf3264323a67c4 [2018-11-12 17:14:49,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:14:49,881 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:14:49,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:14:49,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:14:49,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:14:49,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:49" (1/1) ... [2018-11-12 17:14:49,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f6c87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:49, skipping insertion in model container [2018-11-12 17:14:49,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:49" (1/1) ... [2018-11-12 17:14:49,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:14:49,983 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:14:50,426 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:14:50,441 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:14:50,602 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:14:50,621 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:14:50,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50 WrapperNode [2018-11-12 17:14:50,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:14:50,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:14:50,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:14:50,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:14:50,633 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:14:50" (1/1) ... [2018-11-12 17:14:50,742 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:14:50" (1/1) ... [2018-11-12 17:14:50,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:14:50,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:14:50,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:14:50,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:14:50,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (1/1) ... [2018-11-12 17:14:50,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:14:50,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:14:50,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:14:50,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:14:50,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (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:14:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:14:50,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:14:50,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:14:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:14:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:14:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:14:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:14:50,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:14:50,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:14:54,036 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:14:54,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:54 BoogieIcfgContainer [2018-11-12 17:14:54,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:14:54,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:14:54,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:14:54,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:14:54,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:14:49" (1/3) ... [2018-11-12 17:14:54,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ad4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:54, skipping insertion in model container [2018-11-12 17:14:54,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:50" (2/3) ... [2018-11-12 17:14:54,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ad4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:54, skipping insertion in model container [2018-11-12 17:14:54,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:54" (3/3) ... [2018-11-12 17:14:54,045 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label36_true-unreach-call_false-termination.c [2018-11-12 17:14:54,056 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:14:54,065 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:14:54,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:14:54,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:14:54,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:14:54,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:14:54,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:14:54,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:14:54,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:14:54,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:14:54,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:14:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:14:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 17:14:54,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:54,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:54,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:54,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash -887392241, now seen corresponding path program 1 times [2018-11-12 17:14:54,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:54,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:54,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:54,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:54,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:54,825 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:14:54,925 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:14:54,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:54,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:14:54,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:54,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:14:54,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:14:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:14:54,953 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:14:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:56,611 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-12 17:14:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:14:56,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-12 17:14:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:56,632 INFO L225 Difference]: With dead ends: 618 [2018-11-12 17:14:56,633 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 17:14:56,640 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:14:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 17:14:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 17:14:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 17:14:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-12 17:14:56,719 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 139 [2018-11-12 17:14:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:56,721 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-12 17:14:56,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:14:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-12 17:14:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 17:14:56,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:56,728 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:56,729 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:56,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1146144614, now seen corresponding path program 1 times [2018-11-12 17:14:56,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:56,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:56,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:56,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:56,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:56,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:56,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:56,966 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-12 17:14:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:14:59,136 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-11-12 17:14:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:14:59,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-12 17:14:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:14:59,158 INFO L225 Difference]: With dead ends: 1231 [2018-11-12 17:14:59,158 INFO L226 Difference]: Without dead ends: 858 [2018-11-12 17:14:59,163 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:14:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-12 17:14:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-11-12 17:14:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-12 17:14:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-11-12 17:14:59,239 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 155 [2018-11-12 17:14:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:14:59,239 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-11-12 17:14:59,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:14:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-11-12 17:14:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-12 17:14:59,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:14:59,248 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:14:59,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:14:59,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:14:59,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1857852795, now seen corresponding path program 1 times [2018-11-12 17:14:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:14:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:14:59,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:14:59,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:14:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:14:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:14:59,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:14:59,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:14:59,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:14:59,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:14:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:14:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:14:59,524 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-11-12 17:15:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:03,199 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-11-12 17:15:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:15:03,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-11-12 17:15:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:03,223 INFO L225 Difference]: With dead ends: 2553 [2018-11-12 17:15:03,223 INFO L226 Difference]: Without dead ends: 1738 [2018-11-12 17:15:03,230 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:15:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-12 17:15:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-11-12 17:15:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-11-12 17:15:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-11-12 17:15:03,316 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 162 [2018-11-12 17:15:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:03,316 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-11-12 17:15:03,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:15:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-11-12 17:15:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 17:15:03,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:03,324 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,325 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:03,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 195127661, now seen corresponding path program 1 times [2018-11-12 17:15:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:03,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:03,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:03,572 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 17:15:04,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:04,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:04,002 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-11-12 17:15:04,009 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:04,081 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:04,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:04,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:04,901 INFO L272 AbstractInterpreter]: Visited 140 different actions 140 times. Never merged. Never widened. Performed 1944 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1944 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:15:04,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:04,947 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:05,558 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 81.56% of their original sizes. [2018-11-12 17:15:05,558 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:06,526 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-11-12 17:15:06,526 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:06,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-12 17:15:06,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:06,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:15:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:15:06,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:15:06,529 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 14 states. [2018-11-12 17:15:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:22,436 INFO L93 Difference]: Finished difference Result 3652 states and 5496 transitions. [2018-11-12 17:15:22,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:15:22,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2018-11-12 17:15:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:22,447 INFO L225 Difference]: With dead ends: 3652 [2018-11-12 17:15:22,447 INFO L226 Difference]: Without dead ends: 1978 [2018-11-12 17:15:22,454 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:15:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2018-11-12 17:15:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1825. [2018-11-12 17:15:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-11-12 17:15:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-11-12 17:15:22,504 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 164 [2018-11-12 17:15:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:22,504 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-11-12 17:15:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:15:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-11-12 17:15:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 17:15:22,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:22,513 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:22,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:22,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -6587698, now seen corresponding path program 1 times [2018-11-12 17:15:22,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:22,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:15:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:22,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:22,741 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-12 17:15:22,741 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:22,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:22,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:23,753 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:23,753 INFO L272 AbstractInterpreter]: Visited 144 different actions 431 times. Merged at 7 different actions 21 times. Never widened. Performed 6568 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6568 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:23,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:23,781 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:24,155 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 81.28% of their original sizes. [2018-11-12 17:15:24,155 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:24,718 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-11-12 17:15:24,718 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:24,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:24,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:15:24,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:24,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:24,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:24,720 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 11 states. [2018-11-12 17:15:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:36,885 INFO L93 Difference]: Finished difference Result 5030 states and 7499 transitions. [2018-11-12 17:15:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:15:36,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2018-11-12 17:15:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:36,902 INFO L225 Difference]: With dead ends: 5030 [2018-11-12 17:15:36,902 INFO L226 Difference]: Without dead ends: 3211 [2018-11-12 17:15:36,911 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:15:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2018-11-12 17:15:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 2966. [2018-11-12 17:15:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-12 17:15:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4074 transitions. [2018-11-12 17:15:37,012 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4074 transitions. Word has length 174 [2018-11-12 17:15:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:37,012 INFO L480 AbstractCegarLoop]: Abstraction has 2966 states and 4074 transitions. [2018-11-12 17:15:37,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:15:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4074 transitions. [2018-11-12 17:15:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-12 17:15:37,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:37,024 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:37,024 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:37,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -383543010, now seen corresponding path program 1 times [2018-11-12 17:15:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:37,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:37,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:15:37,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:37,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:15:37,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:37,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:15:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:15:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:37,155 INFO L87 Difference]: Start difference. First operand 2966 states and 4074 transitions. Second operand 3 states. [2018-11-12 17:15:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:38,101 INFO L93 Difference]: Finished difference Result 7194 states and 10348 transitions. [2018-11-12 17:15:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:15:38,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-12 17:15:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:38,122 INFO L225 Difference]: With dead ends: 7194 [2018-11-12 17:15:38,122 INFO L226 Difference]: Without dead ends: 2701 [2018-11-12 17:15:38,142 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:15:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2018-11-12 17:15:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2605. [2018-11-12 17:15:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-11-12 17:15:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3406 transitions. [2018-11-12 17:15:38,214 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3406 transitions. Word has length 176 [2018-11-12 17:15:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:38,215 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 3406 transitions. [2018-11-12 17:15:38,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:15:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3406 transitions. [2018-11-12 17:15:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-12 17:15:38,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:38,224 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:38,224 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:38,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -457317476, now seen corresponding path program 1 times [2018-11-12 17:15:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:38,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:38,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:38,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:15:38,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:38,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:38,683 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-12 17:15:38,683 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:38,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:38,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:39,175 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:39,176 INFO L272 AbstractInterpreter]: Visited 144 different actions 282 times. Merged at 5 different actions 5 times. Never widened. Performed 3494 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3494 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:15:39,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:39,184 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:39,690 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 81.65% of their original sizes. [2018-11-12 17:15:39,690 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:40,016 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-12 17:15:40,016 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:40,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:40,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:15:40,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:40,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:15:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:15:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:15:40,018 INFO L87 Difference]: Start difference. First operand 2605 states and 3406 transitions. Second operand 18 states. [2018-11-12 17:15:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:50,878 INFO L93 Difference]: Finished difference Result 5664 states and 7436 transitions. [2018-11-12 17:15:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:15:50,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 190 [2018-11-12 17:15:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:50,893 INFO L225 Difference]: With dead ends: 5664 [2018-11-12 17:15:50,893 INFO L226 Difference]: Without dead ends: 3065 [2018-11-12 17:15:50,901 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:15:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2018-11-12 17:15:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3055. [2018-11-12 17:15:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2018-11-12 17:15:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 3928 transitions. [2018-11-12 17:15:50,988 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 3928 transitions. Word has length 190 [2018-11-12 17:15:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:50,988 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 3928 transitions. [2018-11-12 17:15:50,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:15:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 3928 transitions. [2018-11-12 17:15:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-12 17:15:51,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:51,002 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:51,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:51,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1990055546, now seen corresponding path program 1 times [2018-11-12 17:15:51,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:51,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:51,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 82 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 17:15:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:51,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:51,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-12 17:15:51,149 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:51,153 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:51,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:52,254 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:52,255 INFO L272 AbstractInterpreter]: Visited 145 different actions 577 times. Merged at 8 different actions 30 times. Never widened. Performed 8416 root evaluator evaluations with a maximum evaluation depth of 4. Performed 8416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:52,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:52,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:52,614 INFO L227 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 81.17% of their original sizes. [2018-11-12 17:15:52,615 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:52,747 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-12 17:15:52,747 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:52,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:52,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-12 17:15:52,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:52,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:15:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:15:52,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:15:52,748 INFO L87 Difference]: Start difference. First operand 3055 states and 3928 transitions. Second operand 10 states. [2018-11-12 17:15:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:57,159 INFO L93 Difference]: Finished difference Result 7459 states and 9578 transitions. [2018-11-12 17:15:57,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:15:57,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2018-11-12 17:15:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:57,174 INFO L225 Difference]: With dead ends: 7459 [2018-11-12 17:15:57,174 INFO L226 Difference]: Without dead ends: 3555 [2018-11-12 17:15:57,183 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-11-12 17:15:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-11-12 17:15:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3513. [2018-11-12 17:15:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3513 states. [2018-11-12 17:15:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 4413 transitions. [2018-11-12 17:15:57,265 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 4413 transitions. Word has length 215 [2018-11-12 17:15:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:57,266 INFO L480 AbstractCegarLoop]: Abstraction has 3513 states and 4413 transitions. [2018-11-12 17:15:57,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:15:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 4413 transitions. [2018-11-12 17:15:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-12 17:15:57,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:57,279 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:15:57,279 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:57,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 343580905, now seen corresponding path program 1 times [2018-11-12 17:15:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:57,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:57,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:57,568 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 112 proven. 96 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:15:58,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:58,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:58,024 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-11-12 17:15:58,024 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:58,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:58,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:58,708 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:58,708 INFO L272 AbstractInterpreter]: Visited 144 different actions 424 times. Merged at 7 different actions 14 times. Never widened. Performed 5283 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5283 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:15:58,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:58,718 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:59,020 INFO L227 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-12 17:15:59,020 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:59,312 INFO L415 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2018-11-12 17:15:59,312 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:59,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-12 17:15:59,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:59,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:15:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:15:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:15:59,314 INFO L87 Difference]: Start difference. First operand 3513 states and 4413 transitions. Second operand 11 states. [2018-11-12 17:16:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:05,887 INFO L93 Difference]: Finished difference Result 8161 states and 10422 transitions. [2018-11-12 17:16:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:16:05,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 254 [2018-11-12 17:16:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:05,905 INFO L225 Difference]: With dead ends: 8161 [2018-11-12 17:16:05,905 INFO L226 Difference]: Without dead ends: 4654 [2018-11-12 17:16:05,913 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:16:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2018-11-12 17:16:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4633. [2018-11-12 17:16:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4633 states. [2018-11-12 17:16:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 5793 transitions. [2018-11-12 17:16:06,022 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 5793 transitions. Word has length 254 [2018-11-12 17:16:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:06,023 INFO L480 AbstractCegarLoop]: Abstraction has 4633 states and 5793 transitions. [2018-11-12 17:16:06,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:16:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 5793 transitions. [2018-11-12 17:16:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-11-12 17:16:06,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:06,039 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:06,039 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:06,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash -362539006, now seen corresponding path program 1 times [2018-11-12 17:16:06,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:06,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:06,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 139 proven. 66 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 17:16:06,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:06,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:06,500 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-11-12 17:16:06,501 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:06,503 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:06,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:07,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:07,255 INFO L272 AbstractInterpreter]: Visited 145 different actions 440 times. Merged at 8 different actions 27 times. Never widened. Performed 6050 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6050 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:07,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:07,263 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:07,598 INFO L227 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-12 17:16:07,598 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:07,731 INFO L415 sIntCurrentIteration]: We unified 267 AI predicates to 267 [2018-11-12 17:16:07,731 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-12 17:16:07,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:16:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:16:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:07,732 INFO L87 Difference]: Start difference. First operand 4633 states and 5793 transitions. Second operand 11 states. [2018-11-12 17:16:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:13,507 INFO L93 Difference]: Finished difference Result 11819 states and 14953 transitions. [2018-11-12 17:16:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:16:13,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 268 [2018-11-12 17:16:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:13,535 INFO L225 Difference]: With dead ends: 11819 [2018-11-12 17:16:13,535 INFO L226 Difference]: Without dead ends: 7192 [2018-11-12 17:16:13,545 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 279 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:16:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2018-11-12 17:16:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 6650. [2018-11-12 17:16:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2018-11-12 17:16:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 8352 transitions. [2018-11-12 17:16:13,699 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 8352 transitions. Word has length 268 [2018-11-12 17:16:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:13,700 INFO L480 AbstractCegarLoop]: Abstraction has 6650 states and 8352 transitions. [2018-11-12 17:16:13,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:16:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 8352 transitions. [2018-11-12 17:16:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-12 17:16:13,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:13,722 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:16:13,722 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:13,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash 655171643, now seen corresponding path program 1 times [2018-11-12 17:16:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:13,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 194 proven. 98 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 17:16:13,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:13,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:13,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 324 with the following transitions: [2018-11-12 17:16:13,996 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:13,998 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:13,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:15,012 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:15,013 INFO L272 AbstractInterpreter]: Visited 148 different actions 745 times. Merged at 9 different actions 53 times. Widened at 1 different actions 2 times. Performed 9752 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:15,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:15,023 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:15,468 INFO L227 lantSequenceWeakener]: Weakened 320 states. On average, predicates are now at 81.01% of their original sizes. [2018-11-12 17:16:15,468 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:15,581 INFO L415 sIntCurrentIteration]: We unified 322 AI predicates to 322 [2018-11-12 17:16:15,581 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:15,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:15,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-12 17:16:15,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:15,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:16:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:16:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:16:15,583 INFO L87 Difference]: Start difference. First operand 6650 states and 8352 transitions. Second operand 12 states. [2018-11-12 17:16:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:26,159 INFO L93 Difference]: Finished difference Result 14566 states and 18367 transitions. [2018-11-12 17:16:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 17:16:26,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 323 [2018-11-12 17:16:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:26,183 INFO L225 Difference]: With dead ends: 14566 [2018-11-12 17:16:26,183 INFO L226 Difference]: Without dead ends: 7587 [2018-11-12 17:16:26,198 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 339 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-11-12 17:16:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7587 states. [2018-11-12 17:16:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7587 to 7546. [2018-11-12 17:16:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7546 states. [2018-11-12 17:16:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 9493 transitions. [2018-11-12 17:16:26,351 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 9493 transitions. Word has length 323 [2018-11-12 17:16:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:26,351 INFO L480 AbstractCegarLoop]: Abstraction has 7546 states and 9493 transitions. [2018-11-12 17:16:26,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:16:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 9493 transitions. [2018-11-12 17:16:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-12 17:16:26,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:26,376 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:26,377 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:26,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:26,377 INFO L82 PathProgramCache]: Analyzing trace with hash 316888943, now seen corresponding path program 1 times [2018-11-12 17:16:26,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:26,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:26,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:26,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:26,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 210 proven. 98 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 17:16:26,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:26,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:26,944 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-12 17:16:26,944 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:26,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:26,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:27,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:27,966 INFO L272 AbstractInterpreter]: Visited 149 different actions 747 times. Merged at 9 different actions 54 times. Widened at 1 different actions 2 times. Performed 9927 root evaluator evaluations with a maximum evaluation depth of 6. Performed 9927 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:27,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:27,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:27,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:27,970 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:16:27,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:27,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:28,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-12 17:16:28,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 210 proven. 98 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 17:16:29,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:29,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:16:29,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:29,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:16:29,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:16:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:29,428 INFO L87 Difference]: Start difference. First operand 7546 states and 9493 transitions. Second operand 9 states. [2018-11-12 17:16:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:34,386 INFO L93 Difference]: Finished difference Result 18627 states and 23785 transitions. [2018-11-12 17:16:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 17:16:34,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 339 [2018-11-12 17:16:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:34,425 INFO L225 Difference]: With dead ends: 18627 [2018-11-12 17:16:34,425 INFO L226 Difference]: Without dead ends: 10721 [2018-11-12 17:16:34,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 700 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 17:16:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states. [2018-11-12 17:16:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 10169. [2018-11-12 17:16:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10169 states. [2018-11-12 17:16:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 11946 transitions. [2018-11-12 17:16:34,666 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 11946 transitions. Word has length 339 [2018-11-12 17:16:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:34,666 INFO L480 AbstractCegarLoop]: Abstraction has 10169 states and 11946 transitions. [2018-11-12 17:16:34,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:16:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 11946 transitions. [2018-11-12 17:16:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-12 17:16:34,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:34,698 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:16:34,698 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:34,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1972708365, now seen corresponding path program 1 times [2018-11-12 17:16:34,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:34,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:34,983 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-12 17:16:35,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:35,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:35,397 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-11-12 17:16:35,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [155], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [783], [785], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:35,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:35,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:36,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:36,648 INFO L272 AbstractInterpreter]: Visited 148 different actions 580 times. Merged at 8 different actions 28 times. Never widened. Performed 8548 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8548 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:16:36,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:36,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:36,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:36,656 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:16:36,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:36,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:36,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-12 17:16:36,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 206 proven. 108 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-12 17:16:37,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:37,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-12 17:16:37,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:37,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:16:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:16:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:16:37,203 INFO L87 Difference]: Start difference. First operand 10169 states and 11946 transitions. Second operand 9 states. [2018-11-12 17:16:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:39,212 INFO L93 Difference]: Finished difference Result 17697 states and 21033 transitions. [2018-11-12 17:16:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:16:39,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 341 [2018-11-12 17:16:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:39,213 INFO L225 Difference]: With dead ends: 17697 [2018-11-12 17:16:39,213 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:16:39,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 687 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:16:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:16:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:16:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:16:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:16:39,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 341 [2018-11-12 17:16:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:39,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:16:39,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:16:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:16:39,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:16:39,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:16:39,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:39,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,384 WARN L179 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 209 [2018-11-12 17:16:40,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:40,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:41,232 WARN L179 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 272 [2018-11-12 17:16:41,813 WARN L179 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-12 17:16:43,201 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-11-12 17:16:48,595 WARN L179 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 397 DAG size of output: 104 [2018-11-12 17:16:49,666 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 235 DAG size of output: 100 [2018-11-12 17:16:51,593 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 288 DAG size of output: 103 [2018-11-12 17:16:51,596 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,597 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:16:51,597 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,597 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,597 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,597 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,597 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:16:51,598 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,599 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:16:51,600 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:16:51,601 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:51,602 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,603 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:16:51,604 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,605 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:16:51,606 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 568) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:16:51,607 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:16:51,608 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:16:51,609 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:16:51,610 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,611 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,612 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse2 (= 7 |old(~a17~0)|)) (.cse6 (not (= ~a17~0 7))) (.cse23 (= |old(~a11~0)| |old(~a19~0)|)) (.cse15 (< 1 |old(~a19~0)|)) (.cse22 (= |old(~a25~0)| ~a25~0)) (.cse16 (<= 7 ~a28~0)) (.cse17 (<= ~a28~0 11)) (.cse9 (< 8 |old(~a17~0)|)) (.cse11 (< |old(~a17~0)| 7)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse1 (not (= 1 ~a21~0))) (.cse13 (not (= 1 |old(~a19~0)|))) (.cse7 (< 1 |old(~a25~0)|)) (.cse27 (not (= 0 |old(~a11~0)|))) (.cse8 (< 11 |old(~a28~0)|)) (.cse5 (< |old(~a28~0)| 7)) (.cse28 (= ~a19~0 1)) (.cse25 (= ~a11~0 |old(~a11~0)|)) (.cse18 (= ~a17~0 8)) (.cse3 (< |old(~a25~0)| 0)) (.cse14 (not (= 8 |old(~a17~0)|))) (.cse10 (< |calculate_output_#in~input| 1)) (.cse19 (< |old(~a28~0)| 10)) (.cse4 (not (= 1 |old(~a11~0)|))) (.cse12 (= 1 |old(~a25~0)|)) (.cse26 (= |old(~a28~0)| ~a28~0)) (.cse20 (= |old(~a19~0)| ~a19~0)) (.cse21 (= 1 ~a11~0)) (.cse24 (= ~a25~0 |old(~a25~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (not (= 7 |old(~a28~0)|)) (not .cse12) (= ~a28~0 7) .cse4 .cse13 .cse14 .cse10) (or .cse15 .cse0 .cse1 (< (+ |old(~a19~0)| 1) 0) .cse3 .cse4 .cse5 .cse12 (and .cse16 .cse17 .cse18) .cse7 .cse8 .cse14 .cse10) (or .cse0 (<= ~a28~0 9) .cse4 (or .cse1 (< 9 |old(~a28~0)|) .cse13 .cse7 .cse3 .cse5) .cse14 .cse10) (or .cse6 .cse2 .cse19 .cse4 .cse12) (or (and .cse20 .cse21 .cse22) .cse23 .cse4) (or .cse0 .cse1 .cse3 .cse4 .cse5 (< 10 |old(~a28~0)|) (<= ~a28~0 10) .cse13 .cse7 .cse14 .cse10) (or .cse2 .cse6 .cse23 .cse4) (or .cse15 .cse0 .cse1 (and .cse20 .cse24 .cse25 .cse26 .cse18) .cse27 (= 9 |old(~a28~0)|) .cse3 .cse5 (< |old(~a19~0)| 0) .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse1 (and .cse22 .cse16 .cse17 .cse21 .cse28 (<= ~a17~0 8) (<= 7 ~a17~0)) .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (or .cse1 .cse13 .cse7 .cse27 .cse8 .cse5) (and .cse28 .cse24 .cse25 .cse26 .cse18) .cse3 .cse14 .cse10) (or .cse19 .cse4 .cse12 (and .cse26 .cse20 .cse21 .cse24)))) [2018-11-12 17:16:51,612 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,612 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,612 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,612 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:16:51,613 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:16:51,614 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:51,615 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,616 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:16:51,617 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:16:51,618 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,619 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:16:51,619 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:16:51,619 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,619 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:16:51,619 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:16:51,620 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse11 (not (= ~a28~0 9))) (.cse12 (<= 1 main_~input~0)) (.cse13 (<= main_~input~0 6)) (.cse7 (= ~a11~0 0)) (.cse8 (<= 0 ~a19~0)) (.cse9 (<= ~a19~0 1)) (.cse10 (= ~a17~0 8)) (.cse1 (not (= ~a19~0 ~a11~0))) (.cse3 (<= 7 ~a28~0)) (.cse4 (<= ~a25~0 1)) (.cse5 (<= ~a28~0 11)) (.cse6 (<= 0 ~a25~0)) (.cse2 (not (= ~a25~0 1))) (.cse0 (= 1 ~a11~0))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and (<= ~a28~0 10) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= |old(~a28~0)| 7)) (and .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse1) (not (= ~a~0 1)) (and .cse3 .cse4 .cse5 .cse6 .cse0 (<= ~a17~0 8) (<= 7 ~a17~0)) (and (<= 10 ~a28~0) .cse2 .cse0) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:16:51,620 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:51,620 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:51,620 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (<= 1 main_~input~0)) (.cse3 (<= main_~input~0 6)) (.cse4 (<= 7 ~a28~0)) (.cse5 (<= ~a25~0 1)) (.cse6 (<= ~a28~0 11)) (.cse7 (<= 0 ~a25~0)) (.cse8 (= ~a11~0 0)) (.cse9 (<= 0 ~a19~0)) (.cse10 (<= ~a19~0 1)) (.cse11 (= ~a17~0 8)) (.cse1 (not (= ~a19~0 ~a11~0))) (.cse0 (= 1 ~a11~0))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~a28~0 9))) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse0 (<= ~a17~0 8) (<= 7 ~a17~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1) (not (= ~a~0 1)) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse0) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:16:51,620 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:16:51,620 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:16:51,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:16:51 BoogieIcfgContainer [2018-11-12 17:16:51,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:16:51,636 INFO L168 Benchmark]: Toolchain (without parser) took 121755.60 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,637 INFO L168 Benchmark]: CDTParser took 0.25 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:16:51,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.82 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,639 INFO L168 Benchmark]: Boogie Preprocessor took 112.52 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,640 INFO L168 Benchmark]: RCFGBuilder took 3173.85 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: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,640 INFO L168 Benchmark]: TraceAbstraction took 117596.98 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,645 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.25 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 739.82 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.52 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3173.85 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: 102.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117596.98 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 568]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(a21 == 1) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || (((((((((!(a25 == 1) && 7 <= a28) && a25 <= 1) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((((((((a28 <= 10 && 7 <= a28) && a25 <= 1) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || !(3 == c)) || !(23 == w)) || ((((((((((1 <= input && input <= 6) && 7 <= a28) && a25 <= 1) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a28 == 9))) || !(\old(a28) == 7)) || ((((((((((1 <= input && input <= 6) && 7 <= a28) && a25 <= 1) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && !(a19 == a11))) || !(a == 1)) || ((((((7 <= a28 && a25 <= 1) && a28 <= 11) && 0 <= a25) && 1 == a11) && a17 <= 8) && 7 <= a17)) || ((10 <= a28 && !(a25 == 1)) && 1 == a11)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 117.5s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 82.1s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2076 SDtfs, 11921 SDslu, 3555 SDs, 0 SdLazy, 17844 SolverSat, 2835 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 3146 GetRequests, 2904 SyntacticMatches, 7 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10169occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.3s AbstIntTime, 9 AbstIntIterations, 7 AbstIntStrong, 0.9970067216132602 AbsIntWeakeningRatio, 0.18659076533839342 AbsIntAvgWeakeningVarsNumRemoved, 29.741302972802025 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1797 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 351 PreInvPairs, 503 NumberOfFragments, 1079 HoareAnnotationTreeSize, 351 FomulaSimplifications, 99585 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 42460 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3580 NumberOfCodeBlocks, 3580 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2112045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 3082/3808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...