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_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:16:11,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:16:11,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:16:11,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:16:11,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:16:11,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:16:11,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:16:11,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:16:11,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:16:11,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:16:11,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:16:11,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:16:11,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:16:11,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:16:11,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:16:11,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:16:11,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:16:11,070 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:16:11,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:16:11,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:16:11,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:16:11,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:16:11,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:16:11,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:16:11,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:16:11,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:16:11,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:16:11,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:16:11,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:16:11,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:16:11,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:16:11,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:16:11,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:16:11,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:16:11,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:16:11,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:16:11,092 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:16:11,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:16:11,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:16:11,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:16:11,115 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:16:11,115 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:16:11,116 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:16:11,117 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:16:11,118 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:16:11,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:16:11,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:16:11,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:16:11,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:16:11,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:16:11,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:16:11,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:16:11,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:16:11,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:16:11,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:16:11,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:16:11,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:16:11,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:16:11,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:16:11,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:16:11,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:16:11,124 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:16:11,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:16:11,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:16:11,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:16:11,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:16:11,193 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:16:11,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-12 17:16:11,249 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08ecbed9/28942e30819b44c7873e4804de96de83/FLAG052d4e478 [2018-11-12 17:16:11,767 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:16:11,768 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-11-12 17:16:11,792 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08ecbed9/28942e30819b44c7873e4804de96de83/FLAG052d4e478 [2018-11-12 17:16:11,813 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08ecbed9/28942e30819b44c7873e4804de96de83 [2018-11-12 17:16:11,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:16:11,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:16:11,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:16:11,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:16:11,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:16:11,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:16:11" (1/1) ... [2018-11-12 17:16:11,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc2efc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:11, skipping insertion in model container [2018-11-12 17:16:11,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:16:11" (1/1) ... [2018-11-12 17:16:11,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:16:11,907 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:16:12,380 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:16:12,385 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:16:12,518 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:16:12,535 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:16:12,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12 WrapperNode [2018-11-12 17:16:12,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:16:12,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:16:12,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:16:12,537 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:16:12,553 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:16:12" (1/1) ... [2018-11-12 17:16:12,668 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:16:12" (1/1) ... [2018-11-12 17:16:12,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:16:12,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:16:12,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:16:12,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:16:12,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (1/1) ... [2018-11-12 17:16:12,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:16:12,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:16:12,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:16:12,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:16:12,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (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:16:12,862 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:16:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:16:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:16:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:16:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:16:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:16:12,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:16:12,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:16:12,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:16:16,124 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:16:16,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:16:16 BoogieIcfgContainer [2018-11-12 17:16:16,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:16:16,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:16:16,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:16:16,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:16:16,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:16:11" (1/3) ... [2018-11-12 17:16:16,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dab0149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:16:16, skipping insertion in model container [2018-11-12 17:16:16,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:16:12" (2/3) ... [2018-11-12 17:16:16,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dab0149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:16:16, skipping insertion in model container [2018-11-12 17:16:16,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:16:16" (3/3) ... [2018-11-12 17:16:16,141 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-11-12 17:16:16,152 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:16:16,161 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:16:16,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:16:16,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:16:16,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:16:16,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:16:16,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:16:16,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:16:16,220 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:16:16,220 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:16:16,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:16:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:16:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 17:16:16,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:16,264 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] [2018-11-12 17:16:16,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:16,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-11-12 17:16:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:16,938 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:17,051 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:16:17,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:17,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:16:17,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:17,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:16:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:16:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:16:17,083 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:16:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:18,673 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-12 17:16:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:16:18,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-12 17:16:18,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:18,698 INFO L225 Difference]: With dead ends: 627 [2018-11-12 17:16:18,698 INFO L226 Difference]: Without dead ends: 388 [2018-11-12 17:16:18,705 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:16:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-12 17:16:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-12 17:16:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-12 17:16:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-12 17:16:18,822 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-11-12 17:16:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:18,824 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-12 17:16:18,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:16:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-12 17:16:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 17:16:18,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:18,832 INFO L375 BasicCegarLoop]: trace histogram [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:16:18,832 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:18,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-11-12 17:16:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:18,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:18,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:19,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:19,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:19,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:19,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:19,331 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-11-12 17:16:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:21,261 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-11-12 17:16:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:21,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-12 17:16:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:21,267 INFO L225 Difference]: With dead ends: 905 [2018-11-12 17:16:21,268 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:16:21,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:16:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:16:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:16:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-11-12 17:16:21,298 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-11-12 17:16:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:21,298 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-11-12 17:16:21,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-11-12 17:16:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 17:16:21,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:21,303 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:21,303 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:21,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-11-12 17:16:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:21,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:21,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:21,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:21,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:16:21,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:21,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:16:21,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:16:21,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:16:21,503 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-11-12 17:16:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:24,404 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-11-12 17:16:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:16:24,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-12 17:16:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:24,418 INFO L225 Difference]: With dead ends: 1241 [2018-11-12 17:16:24,419 INFO L226 Difference]: Without dead ends: 865 [2018-11-12 17:16:24,423 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:16:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-12 17:16:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-11-12 17:16:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-12 17:16:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-11-12 17:16:24,520 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-11-12 17:16:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:24,521 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-11-12 17:16:24,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:16:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-11-12 17:16:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 17:16:24,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:24,525 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-12 17:16:24,525 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:24,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-11-12 17:16:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:24,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:24,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:24,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:24,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:16:24,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:16:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:16:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:16:24,738 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-11-12 17:16:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:27,359 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-11-12 17:16:27,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:16:27,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-12 17:16:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:27,372 INFO L225 Difference]: With dead ends: 2297 [2018-11-12 17:16:27,372 INFO L226 Difference]: Without dead ends: 1485 [2018-11-12 17:16:27,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:16:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-11-12 17:16:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-11-12 17:16:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-11-12 17:16:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-11-12 17:16:27,424 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-11-12 17:16:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:27,425 INFO L480 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-11-12 17:16:27,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:16:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-11-12 17:16:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-12 17:16:27,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:27,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,431 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:27,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-11-12 17:16:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:27,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:27,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:16:27,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:16:27,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:27,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:16:27,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:16:27,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:27,708 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-11-12 17:16:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:28,799 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-11-12 17:16:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:16:28,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-12 17:16:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:28,809 INFO L225 Difference]: With dead ends: 3050 [2018-11-12 17:16:28,809 INFO L226 Difference]: Without dead ends: 1430 [2018-11-12 17:16:28,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:16:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-11-12 17:16:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-11-12 17:16:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-11-12 17:16:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-11-12 17:16:28,858 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-11-12 17:16:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:28,858 INFO L480 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-11-12 17:16:28,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:16:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-11-12 17:16:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-12 17:16:28,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:28,864 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, 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:28,864 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:28,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:28,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-11-12 17:16:28,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:28,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:28,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:16:29,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:29,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:29,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-12 17:16:29,269 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], [124], [128], [131], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:29,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:29,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:31,071 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:31,073 INFO L272 AbstractInterpreter]: Visited 116 different actions 342 times. Merged at 7 different actions 16 times. Never widened. Performed 4706 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4706 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:16:31,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:31,115 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:31,750 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 80.82% of their original sizes. [2018-11-12 17:16:31,751 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:32,693 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-12 17:16:32,693 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:32,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-12 17:16:32,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:32,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:16:32,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:16:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:32,697 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 11 states. [2018-11-12 17:16:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:47,912 INFO L93 Difference]: Finished difference Result 4365 states and 6911 transitions. [2018-11-12 17:16:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:16:47,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2018-11-12 17:16:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:47,929 INFO L225 Difference]: With dead ends: 4365 [2018-11-12 17:16:47,930 INFO L226 Difference]: Without dead ends: 2941 [2018-11-12 17:16:47,938 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:16:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2018-11-12 17:16:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2917. [2018-11-12 17:16:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2018-11-12 17:16:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4185 transitions. [2018-11-12 17:16:48,047 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4185 transitions. Word has length 163 [2018-11-12 17:16:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:48,048 INFO L480 AbstractCegarLoop]: Abstraction has 2917 states and 4185 transitions. [2018-11-12 17:16:48,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:16:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4185 transitions. [2018-11-12 17:16:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 17:16:48,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:48,059 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-12 17:16:48,059 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:48,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1378921477, now seen corresponding path program 1 times [2018-11-12 17:16:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:48,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:16:48,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:48,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:48,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-12 17:16:48,223 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], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:48,228 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:48,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:48,571 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:48,572 INFO L272 AbstractInterpreter]: Visited 117 different actions 230 times. Merged at 5 different actions 7 times. Never widened. Performed 3489 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3489 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:16:48,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:48,578 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:49,295 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 81.35% of their original sizes. [2018-11-12 17:16:49,296 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:50,266 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-11-12 17:16:50,266 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 17:16:50,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:50,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 17:16:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 17:16:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:16:50,268 INFO L87 Difference]: Start difference. First operand 2917 states and 4185 transitions. Second operand 21 states. [2018-11-12 17:17:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:04,284 INFO L93 Difference]: Finished difference Result 6567 states and 9256 transitions. [2018-11-12 17:17:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 17:17:04,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 186 [2018-11-12 17:17:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:04,301 INFO L225 Difference]: With dead ends: 6567 [2018-11-12 17:17:04,302 INFO L226 Difference]: Without dead ends: 3656 [2018-11-12 17:17:04,311 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 17:17:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2018-11-12 17:17:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3506. [2018-11-12 17:17:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-11-12 17:17:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4847 transitions. [2018-11-12 17:17:04,406 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4847 transitions. Word has length 186 [2018-11-12 17:17:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:04,407 INFO L480 AbstractCegarLoop]: Abstraction has 3506 states and 4847 transitions. [2018-11-12 17:17:04,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 17:17:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4847 transitions. [2018-11-12 17:17:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-12 17:17:04,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:17:04,419 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:17:04,419 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:17:04,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1556294915, now seen corresponding path program 1 times [2018-11-12 17:17:04,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:17:04,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:04,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:04,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:04,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:17:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 17:17:04,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:04,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:17:04,590 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-12 17:17:04,591 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], [91], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:17:04,595 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:17:04,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:17:05,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:17:05,411 INFO L272 AbstractInterpreter]: Visited 118 different actions 464 times. Merged at 8 different actions 28 times. Never widened. Performed 6553 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6553 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:17:05,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:05,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:17:05,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:05,416 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:17:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:05,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:17:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:05,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:17:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:17:05,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:17:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:17:06,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:17:06,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:17:06,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:17:06,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:17:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:17:06,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:17:06,342 INFO L87 Difference]: Start difference. First operand 3506 states and 4847 transitions. Second operand 9 states. [2018-11-12 17:17:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:10,694 INFO L93 Difference]: Finished difference Result 9695 states and 14274 transitions. [2018-11-12 17:17:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:17:10,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2018-11-12 17:17:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:10,719 INFO L225 Difference]: With dead ends: 9695 [2018-11-12 17:17:10,719 INFO L226 Difference]: Without dead ends: 4653 [2018-11-12 17:17:10,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:17:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-11-12 17:17:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 4320. [2018-11-12 17:17:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4320 states. [2018-11-12 17:17:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 5394 transitions. [2018-11-12 17:17:10,883 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 5394 transitions. Word has length 190 [2018-11-12 17:17:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:10,883 INFO L480 AbstractCegarLoop]: Abstraction has 4320 states and 5394 transitions. [2018-11-12 17:17:10,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:17:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 5394 transitions. [2018-11-12 17:17:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-12 17:17:10,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:17:10,895 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,896 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:17:10,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1107109121, now seen corresponding path program 1 times [2018-11-12 17:17:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:17:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:10,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:10,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:17:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 118 proven. 91 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-12 17:17:11,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:11,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:17:11,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-12 17:17:11,117 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [29], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:17:11,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:17:11,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:17:11,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:17:11,814 INFO L272 AbstractInterpreter]: Visited 118 different actions 463 times. Merged at 8 different actions 27 times. Never widened. Performed 6403 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6403 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:17:11,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:11,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:17:11,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:11,825 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:17:11,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:11,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:17:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:11,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:17:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 162 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-12 17:17:12,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:17:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-12 17:17:12,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:17:12,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-11-12 17:17:12,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:17:12,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 17:17:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 17:17:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:17:12,197 INFO L87 Difference]: Start difference. First operand 4320 states and 5394 transitions. Second operand 13 states. [2018-11-12 17:17:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:14,824 INFO L93 Difference]: Finished difference Result 10721 states and 14279 transitions. [2018-11-12 17:17:14,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:17:14,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 229 [2018-11-12 17:17:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:14,858 INFO L225 Difference]: With dead ends: 10721 [2018-11-12 17:17:14,858 INFO L226 Difference]: Without dead ends: 6702 [2018-11-12 17:17:14,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 17:17:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2018-11-12 17:17:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 6406. [2018-11-12 17:17:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6406 states. [2018-11-12 17:17:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7801 transitions. [2018-11-12 17:17:15,073 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7801 transitions. Word has length 229 [2018-11-12 17:17:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:15,073 INFO L480 AbstractCegarLoop]: Abstraction has 6406 states and 7801 transitions. [2018-11-12 17:17:15,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 17:17:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7801 transitions. [2018-11-12 17:17:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-12 17:17:15,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:17:15,094 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:15,094 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:17:15,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2002622650, now seen corresponding path program 1 times [2018-11-12 17:17:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:17:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:15,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:17:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:15,396 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:17:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 235 proven. 62 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-12 17:17:16,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:16,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:17:16,053 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-11-12 17:17:16,053 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], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:17:16,057 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:17:16,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:17:17,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:17:17,101 INFO L272 AbstractInterpreter]: Visited 119 different actions 485 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 6589 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6589 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:17:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:17,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:17:17,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:17,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:17:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:17,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:17:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:17,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:17:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-12 17:17:17,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:17:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-12 17:17:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:17:17,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:17:17,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:17:17,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:17:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:17:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:17:17,692 INFO L87 Difference]: Start difference. First operand 6406 states and 7801 transitions. Second operand 11 states. [2018-11-12 17:17:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:20,533 INFO L93 Difference]: Finished difference Result 13868 states and 17208 transitions. [2018-11-12 17:17:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 17:17:20,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2018-11-12 17:17:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:20,578 INFO L225 Difference]: With dead ends: 13868 [2018-11-12 17:17:20,579 INFO L226 Difference]: Without dead ends: 7757 [2018-11-12 17:17:20,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 589 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-11-12 17:17:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2018-11-12 17:17:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 7202. [2018-11-12 17:17:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7202 states. [2018-11-12 17:17:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 8183 transitions. [2018-11-12 17:17:20,794 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 8183 transitions. Word has length 291 [2018-11-12 17:17:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:20,794 INFO L480 AbstractCegarLoop]: Abstraction has 7202 states and 8183 transitions. [2018-11-12 17:17:20,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:17:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 8183 transitions. [2018-11-12 17:17:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-12 17:17:20,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:17:20,813 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:20,814 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:17:20,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1005516339, now seen corresponding path program 1 times [2018-11-12 17:17:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:17:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:20,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:17:20,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:17:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 256 proven. 103 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-12 17:17:21,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:21,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:17:21,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-11-12 17:17:21,345 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [29], [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], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [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], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:17:21,349 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:17:21,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:17:22,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:17:22,217 INFO L272 AbstractInterpreter]: Visited 120 different actions 485 times. Merged at 10 different actions 41 times. Never widened. Performed 6229 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6229 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:17:22,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:17:22,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:17:22,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:17:22,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:17:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:17:22,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:17:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:17:22,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:17:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 421 proven. 4 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-12 17:17:22,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:17:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 347 proven. 48 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-12 17:17:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:17:23,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:17:23,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:17:23,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:17:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:17:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:17:23,343 INFO L87 Difference]: Start difference. First operand 7202 states and 8183 transitions. Second operand 9 states. [2018-11-12 17:17:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:17:26,599 INFO L93 Difference]: Finished difference Result 15391 states and 17649 transitions. [2018-11-12 17:17:26,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 17:17:26,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2018-11-12 17:17:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:17:26,600 INFO L225 Difference]: With dead ends: 15391 [2018-11-12 17:17:26,600 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:17:26,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 680 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-11-12 17:17:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:17:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:17:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:17:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:17:26,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 335 [2018-11-12 17:17:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:17:26,622 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:17:26,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:17:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:17:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:17:26,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:17:27,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,904 WARN L179 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 256 [2018-11-12 17:17:27,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:27,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:17:28,537 WARN L179 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 252 [2018-11-12 17:17:29,231 WARN L179 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-12 17:17:29,566 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 77 [2018-11-12 17:17:38,209 WARN L179 SmtUtils]: Spent 8.62 s on a formula simplification. DAG size of input: 372 DAG size of output: 103 [2018-11-12 17:17:40,441 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 267 DAG size of output: 130 [2018-11-12 17:17:42,153 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 261 DAG size of output: 124 [2018-11-12 17:17:42,157 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:17:42,157 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:17:42,157 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:17:42,157 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,157 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:17:42,158 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:17:42,159 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,160 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:17:42,161 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:17:42,162 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,163 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:17:42,164 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,165 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:17:42,166 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,167 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:17:42,168 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:17:42,169 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,170 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,171 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:17:42,172 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,173 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:17:42,174 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,175 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:17:42,176 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:17:42,177 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,178 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,178 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,178 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse12 (= 1 |old(~a25~0)|))) (let ((.cse28 (not (= ~a28~0 10))) (.cse18 (< 10 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse7 (not .cse12)) (.cse3 (not (= 1 |old(~a19~0)|))) (.cse15 (= ~a25~0 |old(~a25~0)|)) (.cse21 (<= ~a17~0 |old(~a17~0)|)) (.cse22 (= ~a11~0 |old(~a11~0)|)) (.cse27 (not (= ~a25~0 1))) (.cse14 (= ~a19~0 |old(~a19~0)|)) (.cse10 (= 9 |old(~a28~0)|))) (let ((.cse5 (= |old(~a11~0)| |old(~a19~0)|)) (.cse29 (not .cse10)) (.cse30 (and .cse21 .cse22 .cse27 .cse14)) (.cse2 (and .cse22 (= |old(~a17~0)| ~a17~0) .cse14 (= ~a28~0 |old(~a28~0)|) .cse15)) (.cse1 (< |old(~a17~0)| 8)) (.cse8 (= 8 |old(~a28~0)|)) (.cse11 (< 0 |old(~a19~0)|)) (.cse6 (< 8 |old(~a17~0)|)) (.cse16 (< 6 |calculate_output_#in~input|)) (.cse24 (and (or .cse18 (< 1 |old(~a19~0)|) .cse0) (or .cse0 .cse7 .cse3))) (.cse17 (not (= 0 |old(~a11~0)|))) (.cse4 (< |old(~a28~0)| 9)) (.cse23 (= |old(~a28~0)| ~a28~0)) (.cse13 (= ~a17~0 8)) (.cse19 (not (= 8 |old(~a17~0)|))) (.cse20 (< |calculate_output_#in~input| 1)) (.cse9 (= 10 |old(~a28~0)|)) (.cse25 (< 7 |old(~a17~0)|)) (.cse26 (and .cse21 .cse22 .cse14 .cse28))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse2 .cse8 .cse6) (or .cse0 .cse1 .cse2 .cse9 .cse10 .cse11 .cse6 .cse12) (or (and (and (and (= ~a11~0 0) .cse13 (= ~a28~0 7)) .cse14) .cse15) (or (or .cse16 .cse0 .cse17 (< |old(~a28~0)| 7) .cse18 .cse3 .cse9 .cse19 (not (= 0 |old(~a25~0)|)) .cse20) .cse8 .cse10)) (or (and .cse15 .cse21 .cse22 (<= 8 ~a17~0) .cse23 .cse14) .cse7 (or .cse16 .cse24 .cse17 .cse3 .cse19 .cse20)) (or .cse0 .cse9 .cse5 .cse25 .cse26) (or .cse0 (and .cse21 .cse22 .cse27 .cse14 .cse28) .cse9 .cse25 .cse12) (or .cse0 .cse1 .cse3 .cse2 .cse6 .cse29) (or .cse0 .cse30 .cse5 .cse25 .cse12) (or .cse2 .cse0 .cse1 .cse5 .cse11 .cse6 .cse29 .cse12) (or .cse0 .cse30 .cse3 .cse25 .cse12) (or .cse2 .cse0 .cse1 .cse9 .cse8 .cse10 .cse11 .cse6) (or .cse16 .cse7 .cse24 .cse17 .cse10 (< |old(~a19~0)| 0) .cse4 (and .cse15 .cse22 .cse23 .cse13 .cse14) .cse19 .cse20) (or .cse0 .cse3 .cse9 .cse25 .cse26))))) [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:17:42,179 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:17:42,180 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,181 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:17:42,182 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:17:42,183 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:17:42,184 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:17:42,185 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:17:42,186 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:17:42,187 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:17:42,187 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:17:42,187 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:17:42,187 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:17:42,187 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (and (= |old(~a17~0)| ~a17~0) (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0)) (not (= ~u~0 21)) (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:17:42,187 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:17:42,188 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (not (= ~a25~0 1))) (.cse7 (<= ~a19~0 0)) (.cse1 (not (= ~a28~0 8))) (.cse8 (not (= ~a28~0 9))) (.cse10 (= 9 ~a28~0)) (.cse4 (<= ~a17~0 8)) (.cse5 (<= ~a17~0 7)) (.cse2 (not (= ~a28~0 10))) (.cse12 (= ~a11~0 0)) (.cse13 (= ~a17~0 8)) (.cse0 (= 1 ~a25~0)) (.cse3 (= 1 ~a19~0)) (.cse9 (not (= ~a19~0 ~a11~0))) (.cse14 (= |old(~a17~0)| ~a17~0)) (.cse11 (<= 9 ~a28~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2) (not (= ~a21~0 1)) (and .cse7 .cse6 .cse2 .cse4 .cse8) (not (= ~y~0 25)) (and .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse10 .cse4 .cse9) (and (<= 1 main_~input~0) (<= main_~input~0 6) .cse0 .cse11 .cse8 (and .cse12 (<= 0 ~a19~0) (<= ~a19~0 1) .cse13)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse0 (= 8 ~a17~0) .cse3 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 .cse6 .cse3) (not (= ~z~0 26)) (and .cse7 .cse14 .cse1 .cse2 .cse8) (not (= 0 |old(~a25~0)|)) (and (and .cse12 (= ~a25~0 0)) (<= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) .cse4) (and .cse10 .cse3 .cse4) (not (= 3 ~c~0)) (and .cse5 .cse9 .cse2) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and (and .cse3 (and .cse12 .cse13)) .cse0) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and (and (and .cse3 .cse9) .cse14) .cse11) (not (= 6 ~f~0)))) [2018-11-12 17:17:42,188 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:17:42,188 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:17:42,189 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse7 (= ~a21~0 1))) (let ((.cse6 (not (= ~a25~0 1))) (.cse8 (<= ~a19~0 0)) (.cse1 (not (= ~a28~0 8))) (.cse9 (not (= ~a28~0 9))) (.cse11 (= 9 ~a28~0)) (.cse4 (<= ~a17~0 8)) (.cse5 (<= ~a17~0 7)) (.cse2 (not (= ~a28~0 10))) (.cse0 (= 1 ~a25~0)) (.cse12 (<= 1 main_~input~0)) (.cse13 (<= main_~input~0 6)) (.cse15 (and (<= 0 (+ main_~input~0 2147483648)) (<= 0 ~a25~0) (= ~a11~0 0) (<= 0 ~a19~0) (<= ~a19~0 1) (<= ~a28~0 10) (= ~a17~0 8) .cse7 (<= 7 ~a28~0) (<= ~a25~0 1) (<= main_~input~0 2147483647))) (.cse3 (= 1 ~a19~0)) (.cse10 (not (= ~a19~0 ~a11~0))) (.cse16 (= |old(~a17~0)| ~a17~0)) (.cse14 (<= 9 ~a28~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2) (not .cse7) (and .cse8 .cse6 .cse2 .cse4 .cse9) (not (= ~y~0 25)) (and .cse5 .cse6 .cse10) (and .cse8 .cse6 .cse11 .cse4 .cse10) (and .cse12 .cse13 .cse0 .cse14 .cse9 .cse15) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse0 (= 8 ~a17~0) .cse3 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 .cse3 .cse2) (not (= 21 ~u~0)) (and (and .cse12 .cse13 .cse15) (= ~a28~0 |old(~a28~0)|)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 .cse6 .cse3) (not (= ~z~0 26)) (and .cse8 .cse16 .cse1 .cse2 .cse9) (not (= 0 |old(~a25~0)|)) (and .cse11 .cse3 .cse4) (not (= 3 ~c~0)) (and .cse5 .cse10 .cse2) (and .cse0 (and .cse12 .cse13 .cse3 .cse15)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and (and (and .cse3 .cse10) .cse16) .cse14) (not (= 6 ~f~0))))) [2018-11-12 17:17:42,189 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:17:42,189 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:17:42,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:17:42 BoogieIcfgContainer [2018-11-12 17:17:42,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:17:42,207 INFO L168 Benchmark]: Toolchain (without parser) took 90380.39 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -76.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:17:42,208 INFO L168 Benchmark]: CDTParser took 0.24 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:17:42,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.69 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:42,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:42,210 INFO L168 Benchmark]: Boogie Preprocessor took 111.37 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:17:42,211 INFO L168 Benchmark]: RCFGBuilder took 3334.39 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. [2018-11-12 17:17:42,212 INFO L168 Benchmark]: TraceAbstraction took 86079.80 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 579.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-12 17:17:42,217 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.24 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 707.69 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 141.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.37 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 3334.39 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: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86079.80 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 579.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: 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: ((((((((((((((((((((((((((((((((((1 == a25 && !(a28 == 8)) && !(a28 == 10)) && 1 == a19) && a17 <= 8) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 10))) || !(a21 == 1)) || ((((a19 <= 0 && !(a25 == 1)) && !(a28 == 10)) && a17 <= 8) && !(a28 == 9))) || !(y == 25)) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || ((((a19 <= 0 && !(a25 == 1)) && 9 == a28) && a17 <= 8) && !(a19 == a11))) || (((((1 <= input && input <= 6) && 1 == a25) && 9 <= a28) && !(a28 == 9)) && ((a11 == 0 && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(1 == \old(a19))) || !(x == 24)) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || ((a17 <= 7 && 1 == a19) && !(a28 == 10))) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((a17 <= 7 && !(a25 == 1)) && 1 == a19)) || !(z == 26)) || ((((a19 <= 0 && \old(a17) == a17) && !(a28 == 8)) && !(a28 == 10)) && !(a28 == 9))) || !(0 == \old(a25))) || ((((a11 == 0 && a25 == 0) && a19 <= \old(a19)) && a28 == \old(a28)) && a17 <= 8)) || ((9 == a28 && 1 == a19) && a17 <= 8)) || !(3 == c)) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || !(23 == w)) || !(\old(a28) == 7)) || ((1 == a19 && a11 == 0 && a17 == 8) && 1 == a25)) || !(a == 1)) || !(\old(a17) == 8)) || (((1 == a19 && !(a19 == a11)) && \old(a17) == a17) && 9 <= a28)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 85.9s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 52.8s AutomataDifference, 0.0s DeadEndRemovalTime, 15.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1426 SDtfs, 13784 SDslu, 1822 SDs, 0 SdLazy, 16466 SolverSat, 3129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2648 GetRequests, 2458 SyntacticMatches, 14 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7202occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.6s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9969542605836899 AbsIntWeakeningRatio, 0.207492795389049 AbsIntAvgWeakeningVarsNumRemoved, 21.855907780979827 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1417 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 258 PreInvPairs, 426 NumberOfFragments, 1455 HoareAnnotationTreeSize, 258 FomulaSimplifications, 37060 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 31271 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3058 NumberOfCodeBlocks, 3058 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4084 ConstructedInterpolants, 0 QuantifiedInterpolants, 2335193 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 3453/3929 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...