java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:05:39,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:05:39,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:05:39,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:05:39,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:05:39,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:05:39,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:05:39,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:05:39,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:05:39,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:05:39,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:05:39,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:05:39,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:05:39,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:05:39,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:05:39,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:05:39,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:05:39,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:05:39,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:05:39,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:05:39,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:05:39,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:05:39,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:05:39,099 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:05:39,099 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:05:39,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:05:39,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:05:39,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:05:39,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:05:39,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:05:39,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:05:39,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:05:39,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:05:39,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:05:39,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:05:39,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:05:39,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:05:39,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:05:39,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:05:39,144 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:05:39,144 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:05:39,145 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:05:39,146 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:05:39,146 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:05:39,146 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:05:39,146 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:05:39,146 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:05:39,147 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:05:39,147 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:05:39,147 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:05:39,147 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:05:39,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:05:39,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:05:39,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:05:39,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:05:39,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:05:39,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:05:39,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:05:39,150 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:05:39,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:05:39,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:05:39,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:05:39,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:05:39,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:05:39,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:05:39,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:05:39,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:05:39,154 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:05:39,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:05:39,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:05:39,155 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:05:39,155 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:05:39,155 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:05:39,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:05:39,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:05:39,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:05:39,246 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:05:39,247 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:05:39,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-10-25 00:05:39,317 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4157ef5a/d032bb4a9e3f42c6987d924fcba1e758/FLAG66bfba2b9 [2018-10-25 00:05:39,918 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:05:39,919 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-10-25 00:05:39,939 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4157ef5a/d032bb4a9e3f42c6987d924fcba1e758/FLAG66bfba2b9 [2018-10-25 00:05:39,960 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f4157ef5a/d032bb4a9e3f42c6987d924fcba1e758 [2018-10-25 00:05:39,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:05:39,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:05:39,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:39,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:05:39,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:05:39,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:39" (1/1) ... [2018-10-25 00:05:39,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379aca2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:39, skipping insertion in model container [2018-10-25 00:05:39,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:05:39" (1/1) ... [2018-10-25 00:05:39,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:05:40,074 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:05:40,599 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:40,605 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:05:40,714 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:05:40,736 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:05:40,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40 WrapperNode [2018-10-25 00:05:40,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:05:40,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:40,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:05:40,738 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:05:40,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:05:40,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:05:40,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:05:40,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:05:40,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:40,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:41,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:41,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... [2018-10-25 00:05:41,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:05:41,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:05:41,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:05:41,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:05:41,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:05:41,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:05:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:05:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:05:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:05:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:05:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:05:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:05:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:05:44,707 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:05:44,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:44 BoogieIcfgContainer [2018-10-25 00:05:44,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:05:44,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:05:44,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:05:44,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:05:44,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:05:39" (1/3) ... [2018-10-25 00:05:44,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417f998a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:44, skipping insertion in model container [2018-10-25 00:05:44,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:05:40" (2/3) ... [2018-10-25 00:05:44,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417f998a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:05:44, skipping insertion in model container [2018-10-25 00:05:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:05:44" (3/3) ... [2018-10-25 00:05:44,728 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label20_true-unreach-call_false-termination.c [2018-10-25 00:05:44,739 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:05:44,752 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:05:44,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:05:44,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:05:44,828 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:05:44,829 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:05:44,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:05:44,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:05:44,829 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:05:44,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:05:44,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:05:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:05:44,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-25 00:05:44,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:44,896 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] [2018-10-25 00:05:44,899 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:44,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash 915772480, now seen corresponding path program 1 times [2018-10-25 00:05:44,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:44,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:44,968 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:45,577 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:45,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:05:45,727 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:45,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:05:45,754 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:05:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:47,324 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-25 00:05:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:47,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-10-25 00:05:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:47,358 INFO L225 Difference]: With dead ends: 618 [2018-10-25 00:05:47,358 INFO L226 Difference]: Without dead ends: 379 [2018-10-25 00:05:47,368 INFO L605 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-10-25 00:05:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-25 00:05:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-25 00:05:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-25 00:05:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-25 00:05:47,452 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 106 [2018-10-25 00:05:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:47,453 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-25 00:05:47,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-25 00:05:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-25 00:05:47,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:47,462 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:47,462 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:47,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1354213973, now seen corresponding path program 1 times [2018-10-25 00:05:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:47,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:47,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:47,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:47,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:47,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:47,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:47,659 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:47,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:47,663 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-25 00:05:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:49,964 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-10-25 00:05:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:05:49,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-10-25 00:05:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:49,975 INFO L225 Difference]: With dead ends: 1229 [2018-10-25 00:05:49,976 INFO L226 Difference]: Without dead ends: 856 [2018-10-25 00:05:49,981 INFO L605 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-10-25 00:05:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-25 00:05:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-10-25 00:05:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-25 00:05:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-10-25 00:05:50,060 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 122 [2018-10-25 00:05:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:50,060 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-10-25 00:05:50,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-10-25 00:05:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-25 00:05:50,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:50,067 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:50,067 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:50,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash -796384502, now seen corresponding path program 1 times [2018-10-25 00:05:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:50,325 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:50,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:05:50,515 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:50,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:50,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:50,517 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-10-25 00:05:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:54,641 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-10-25 00:05:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:54,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-10-25 00:05:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:54,664 INFO L225 Difference]: With dead ends: 2557 [2018-10-25 00:05:54,664 INFO L226 Difference]: Without dead ends: 1740 [2018-10-25 00:05:54,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:05:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-25 00:05:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-10-25 00:05:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-10-25 00:05:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-10-25 00:05:54,743 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 129 [2018-10-25 00:05:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:54,744 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-10-25 00:05:54,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-10-25 00:05:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 00:05:54,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:54,750 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:54,750 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:54,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash 80807714, now seen corresponding path program 1 times [2018-10-25 00:05:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:54,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:54,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 00:05:54,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:54,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:54,946 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-10-25 00:05:54,948 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:54,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:54,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:55,595 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:55,598 INFO L272 AbstractInterpreter]: Visited 107 different actions 107 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:05:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:55,641 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:56,126 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-25 00:05:56,127 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:56,386 INFO L413 sIntCurrentIteration]: We have 130 unified AI predicates [2018-10-25 00:05:56,387 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:56,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 00:05:56,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:56,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:05:56,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:05:56,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:05:56,390 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 6 states. [2018-10-25 00:06:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:06,744 INFO L93 Difference]: Finished difference Result 3506 states and 5281 transitions. [2018-10-25 00:06:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:06:06,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-25 00:06:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:06,754 INFO L225 Difference]: With dead ends: 3506 [2018-10-25 00:06:06,754 INFO L226 Difference]: Without dead ends: 1830 [2018-10-25 00:06:06,761 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:06:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-25 00:06:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2018-10-25 00:06:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-25 00:06:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-10-25 00:06:06,812 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 131 [2018-10-25 00:06:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:06,813 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-10-25 00:06:06,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-10-25 00:06:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 00:06:06,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:06,819 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:06,819 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:06,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2031058527, now seen corresponding path program 1 times [2018-10-25 00:06:06,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:06,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:06:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:07,056 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:07,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-10-25 00:06:07,056 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:07,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:07,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:07,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:06:07,603 INFO L272 AbstractInterpreter]: Visited 111 different actions 330 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:07,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:07,642 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:06:08,839 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.94% of their original sizes. [2018-10-25 00:06:08,840 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:06:12,703 INFO L413 sIntCurrentIteration]: We have 140 unified AI predicates [2018-10-25 00:06:12,703 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:06:12,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:12,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2018-10-25 00:06:12,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:12,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:06:12,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:06:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:06:12,705 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 12 states. [2018-10-25 00:06:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:25,754 INFO L93 Difference]: Finished difference Result 5086 states and 7444 transitions. [2018-10-25 00:06:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:25,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 141 [2018-10-25 00:06:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:25,771 INFO L225 Difference]: With dead ends: 5086 [2018-10-25 00:06:25,771 INFO L226 Difference]: Without dead ends: 3265 [2018-10-25 00:06:25,778 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 27 SyntacticMatches, 103 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2018-10-25 00:06:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3069. [2018-10-25 00:06:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2018-10-25 00:06:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 4237 transitions. [2018-10-25 00:06:25,871 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 4237 transitions. Word has length 141 [2018-10-25 00:06:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:25,871 INFO L481 AbstractCegarLoop]: Abstraction has 3069 states and 4237 transitions. [2018-10-25 00:06:25,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:06:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4237 transitions. [2018-10-25 00:06:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-25 00:06:25,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:25,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:25,880 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:25,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1483859631, now seen corresponding path program 1 times [2018-10-25 00:06:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:25,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:06:26,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:26,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:26,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-10-25 00:06:26,093 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:26,099 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:26,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:26,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:26,491 INFO L272 AbstractInterpreter]: Visited 111 different actions 328 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:26,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:26,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:26,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:26,498 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:06:26,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:26,508 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:26,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:26,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:27,178 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:06:27,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-25 00:06:27,178 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:06:27,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:06:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:06:27,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:06:27,180 INFO L87 Difference]: Start difference. First operand 3069 states and 4237 transitions. Second operand 3 states. [2018-10-25 00:06:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:29,283 INFO L93 Difference]: Finished difference Result 8227 states and 11891 transitions. [2018-10-25 00:06:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:06:29,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-25 00:06:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:29,312 INFO L225 Difference]: With dead ends: 8227 [2018-10-25 00:06:29,312 INFO L226 Difference]: Without dead ends: 5308 [2018-10-25 00:06:29,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:06:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5308 states. [2018-10-25 00:06:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5308 to 5304. [2018-10-25 00:06:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2018-10-25 00:06:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 7035 transitions. [2018-10-25 00:06:29,463 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 7035 transitions. Word has length 143 [2018-10-25 00:06:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:29,463 INFO L481 AbstractCegarLoop]: Abstraction has 5304 states and 7035 transitions. [2018-10-25 00:06:29,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:06:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 7035 transitions. [2018-10-25 00:06:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-25 00:06:29,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:29,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:29,474 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:29,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1372098695, now seen corresponding path program 1 times [2018-10-25 00:06:29,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:29,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:29,698 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:06:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:30,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:30,073 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:30,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-10-25 00:06:30,074 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:30,078 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:30,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:30,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:30,654 INFO L272 AbstractInterpreter]: Visited 111 different actions 328 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:30,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:30,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:30,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:30,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:06:30,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:30,710 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:30,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:31,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:32,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:32,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:06:32,145 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:32,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:06:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:06:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:32,146 INFO L87 Difference]: Start difference. First operand 5304 states and 7035 transitions. Second operand 9 states. [2018-10-25 00:06:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:34,314 INFO L93 Difference]: Finished difference Result 11190 states and 15125 transitions. [2018-10-25 00:06:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:06:34,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-10-25 00:06:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:34,342 INFO L225 Difference]: With dead ends: 11190 [2018-10-25 00:06:34,342 INFO L226 Difference]: Without dead ends: 5792 [2018-10-25 00:06:34,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:06:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2018-10-25 00:06:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 5701. [2018-10-25 00:06:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2018-10-25 00:06:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 6981 transitions. [2018-10-25 00:06:34,545 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 6981 transitions. Word has length 152 [2018-10-25 00:06:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:34,545 INFO L481 AbstractCegarLoop]: Abstraction has 5701 states and 6981 transitions. [2018-10-25 00:06:34,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:06:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 6981 transitions. [2018-10-25 00:06:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 00:06:34,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:34,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:06:34,557 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:34,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -793512577, now seen corresponding path program 1 times [2018-10-25 00:06:34,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:34,559 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:35,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:35,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:35,042 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-10-25 00:06:35,043 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], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:35,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:35,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:35,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:35,851 INFO L272 AbstractInterpreter]: Visited 111 different actions 331 times. Merged at 7 different actions 22 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:06:35,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:35,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:35,861 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:06:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:35,874 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:35,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:35,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:36,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:36,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-10-25 00:06:36,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:36,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:06:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:06:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:06:36,120 INFO L87 Difference]: Start difference. First operand 5701 states and 6981 transitions. Second operand 6 states. [2018-10-25 00:06:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:38,141 INFO L93 Difference]: Finished difference Result 12959 states and 15978 transitions. [2018-10-25 00:06:38,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:06:38,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 00:06:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:38,173 INFO L225 Difference]: With dead ends: 12959 [2018-10-25 00:06:38,173 INFO L226 Difference]: Without dead ends: 7784 [2018-10-25 00:06:38,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7784 states. [2018-10-25 00:06:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7784 to 7673. [2018-10-25 00:06:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7673 states. [2018-10-25 00:06:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7673 states to 7673 states and 9161 transitions. [2018-10-25 00:06:38,393 INFO L78 Accepts]: Start accepts. Automaton has 7673 states and 9161 transitions. Word has length 156 [2018-10-25 00:06:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:38,393 INFO L481 AbstractCegarLoop]: Abstraction has 7673 states and 9161 transitions. [2018-10-25 00:06:38,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:06:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7673 states and 9161 transitions. [2018-10-25 00:06:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-25 00:06:38,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:38,415 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:06:38,415 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:38,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1488399591, now seen corresponding path program 1 times [2018-10-25 00:06:38,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:38,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:38,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:38,772 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:06:39,135 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-25 00:06:39,368 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:06:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 165 proven. 84 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-25 00:06:39,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:39,679 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:39,680 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-10-25 00:06:39,680 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [190], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:39,683 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:39,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:40,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:40,231 INFO L272 AbstractInterpreter]: Visited 115 different actions 344 times. Merged at 9 different actions 27 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:40,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:40,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:40,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:40,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:06:40,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:40,279 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:40,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-25 00:06:40,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 180 proven. 49 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-25 00:06:40,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:40,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-10-25 00:06:40,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:40,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:06:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:06:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:40,783 INFO L87 Difference]: Start difference. First operand 7673 states and 9161 transitions. Second operand 15 states. [2018-10-25 00:06:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:43,779 INFO L93 Difference]: Finished difference Result 14527 states and 17676 transitions. [2018-10-25 00:06:43,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-25 00:06:43,782 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 252 [2018-10-25 00:06:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:43,783 INFO L225 Difference]: With dead ends: 14527 [2018-10-25 00:06:43,783 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:06:43,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 514 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2018-10-25 00:06:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:06:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:06:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:06:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:06:43,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2018-10-25 00:06:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:43,820 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:06:43,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:06:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:06:43,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:06:43,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:06:44,201 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2018-10-25 00:06:44,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,491 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 139 [2018-10-25 00:06:44,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:44,642 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 141 [2018-10-25 00:06:45,599 WARN L179 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-10-25 00:06:45,876 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2018-10-25 00:06:47,054 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 266 DAG size of output: 50 [2018-10-25 00:06:47,577 WARN L179 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 86 [2018-10-25 00:06:48,055 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 86 [2018-10-25 00:06:48,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:48,058 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:06:48,058 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:06:48,059 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:06:48,060 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:06:48,061 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:06:48,062 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,063 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:06:48,064 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,065 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:06:48,066 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:06:48,067 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,068 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:06:48,069 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,070 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,071 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:06:48,072 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a17~0 |old(~a17~0)|)) (.cse6 (not (= 1 |old(~a25~0)|))) (.cse1 (= |old(~a28~0)| ~a28~0)) (.cse0 (< 10 |old(~a28~0)|)) (.cse2 (= |old(~a19~0)| ~a19~0)) (.cse3 (= ~a11~0 |old(~a11~0)|)) (.cse7 (= 7 ~a17~0)) (.cse5 (= ~a25~0 |old(~a25~0)|)) (.cse8 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~a17~0)| 8))) (or .cse6 (= |old(~a11~0)| |old(~a19~0)|) (or (not (= 1 ~a21~0)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|))) (and .cse3 .cse1 .cse2 .cse4 .cse5)) (or .cse0 .cse6 (and .cse1 .cse2 .cse3 .cse7 .cse5) .cse8) (or .cse0 (and .cse2 .cse3 (<= 10 ~a28~0) .cse7 (<= ~a28~0 10) .cse5) (< |old(~a28~0)| 10) .cse8))) [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,073 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:06:48,074 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:06:48,075 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,076 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:06:48,077 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:06:48,078 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:48,078 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-10-25 00:06:48,078 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:06:48,079 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:48,079 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (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-10-25 00:06:48,079 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:06:48,079 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 7 ~a17~0)) (.cse2 (<= ~a28~0 10)) (.cse1 (= 1 ~a25~0))) (or (and .cse0 .cse1 .cse2) (and (= |old(~a17~0)| ~a17~0) .cse2) (and (<= 10 ~a28~0) .cse0 .cse2) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse1 (and (= ~a17~0 8) (= ~a19~0 1)) (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:06:48,079 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:48,079 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:48,079 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 7 ~a17~0)) (.cse2 (<= ~a28~0 10)) (.cse1 (= 1 ~a25~0))) (or (and .cse0 .cse1 .cse2) (and (= |old(~a17~0)| ~a17~0) .cse2) (and (<= 10 ~a28~0) .cse0 .cse2) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse1 (and (= ~a17~0 8) (= ~a19~0 1)) (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:06:48,079 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:06:48,080 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:06:48,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:06:48 BoogieIcfgContainer [2018-10-25 00:06:48,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:06:48,095 INFO L168 Benchmark]: Toolchain (without parser) took 68121.44 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:48,096 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-10-25 00:06:48,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:48,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:48,098 INFO L168 Benchmark]: Boogie Preprocessor took 109.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:06:48,098 INFO L168 Benchmark]: RCFGBuilder took 3663.93 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: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:48,099 INFO L168 Benchmark]: TraceAbstraction took 63384.77 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:48,104 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 761.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 196.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -820.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3663.93 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: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63384.77 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: 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: (((((((((((((((((((((7 == a17 && 1 == a25) && a28 <= 10) || (\old(a17) == a17 && a28 <= 10)) || ((10 <= a28 && 7 == a17) && a28 <= 10)) || !(a21 == 1)) || !(y == 25)) || ((1 == a25 && a17 == 8 && a19 == 1) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 63.2s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1574 SDtfs, 8586 SDslu, 1629 SDs, 0 SdLazy, 11172 SolverSat, 1845 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1778 GetRequests, 1574 SyntacticMatches, 116 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7673occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.996460082865312 AbsIntWeakeningRatio, 0.26666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 13.518518518518519 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 496 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 190 PreInvPairs, 286 NumberOfFragments, 500 HoareAnnotationTreeSize, 190 FomulaSimplifications, 11187 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9622 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2035 NumberOfCodeBlocks, 2035 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2721 ConstructedInterpolants, 0 QuantifiedInterpolants, 1006775 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1823 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 1210/1384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...