java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:05:46,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:05:46,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:05:46,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:05:46,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:05:46,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:05:46,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:05:46,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:05:46,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:05:46,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:05:46,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:05:46,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:05:46,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:05:46,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:05:46,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:05:46,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:05:46,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:05:46,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:05:47,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:05:47,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:05:47,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:05:47,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:05:47,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:05:47,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:05:47,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:05:47,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:05:47,011 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:05:47,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:05:47,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:05:47,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:05:47,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:05:47,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:05:47,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:05:47,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:05:47,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:05:47,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:05:47,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:05:47,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:05:47,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:05:47,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:05:47,037 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:05:47,037 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:05:47,037 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:05:47,038 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:05:47,038 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:05:47,038 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:05:47,038 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:05:47,039 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:05:47,039 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:05:47,039 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:05:47,039 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:05:47,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:05:47,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:05:47,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:05:47,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:05:47,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:05:47,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:05:47,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:05:47,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:05:47,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:05:47,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:05:47,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:05:47,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:05:47,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:05:47,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:05:47,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:05:47,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:05:47,044 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:05:47,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:05:47,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:05:47,045 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:05:47,045 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:05:47,045 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:05:47,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:05:47,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:05:47,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:05:47,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:05:47,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:05:47,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 07:05:47,171 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42c136e8/de9c1a11b17b4f9a8833d90e39c3a33f/FLAG9548b2f31 [2018-11-07 07:05:47,768 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:05:47,772 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 07:05:47,793 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42c136e8/de9c1a11b17b4f9a8833d90e39c3a33f/FLAG9548b2f31 [2018-11-07 07:05:47,813 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c42c136e8/de9c1a11b17b4f9a8833d90e39c3a33f [2018-11-07 07:05:47,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:05:47,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:05:47,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:47,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:05:47,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:05:47,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:47" (1/1) ... [2018-11-07 07:05:47,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a4ee8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:47, skipping insertion in model container [2018-11-07 07:05:47,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:47" (1/1) ... [2018-11-07 07:05:47,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:05:47,916 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:05:48,403 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:48,413 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:05:48,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:48,569 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:05:48,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48 WrapperNode [2018-11-07 07:05:48,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:48,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:48,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:05:48,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:05:48,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:48,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:05:48,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:05:48,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:05:48,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... [2018-11-07 07:05:48,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:05:48,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:05:48,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:05:48,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:05:48,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:05:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:05:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:05:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:05:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:05:48,894 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:05:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:05:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:05:48,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:05:48,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:05:51,976 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:05:51,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:51 BoogieIcfgContainer [2018-11-07 07:05:51,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:05:51,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:05:51,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:05:51,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:05:51,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:05:47" (1/3) ... [2018-11-07 07:05:51,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab474ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:51, skipping insertion in model container [2018-11-07 07:05:51,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:48" (2/3) ... [2018-11-07 07:05:51,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab474ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:51, skipping insertion in model container [2018-11-07 07:05:51,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:51" (3/3) ... [2018-11-07 07:05:51,986 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 07:05:51,996 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:05:52,006 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:05:52,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:05:52,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:05:52,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:05:52,066 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:05:52,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:05:52,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:05:52,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:05:52,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:05:52,067 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:05:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:05:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 07:05:52,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:52,110 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:52,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:52,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1144269880, now seen corresponding path program 1 times [2018-11-07 07:05:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:52,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:52,742 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:05:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:52,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:52,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:52,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:52,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:52,925 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:05:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:54,370 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:05:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:54,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-07 07:05:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:54,392 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:05:54,392 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:05:54,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:05:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:05:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:05:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 07:05:54,496 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 112 [2018-11-07 07:05:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:54,497 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 07:05:54,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 07:05:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 07:05:54,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:54,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:54,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:54,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -255516033, now seen corresponding path program 1 times [2018-11-07 07:05:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:54,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:54,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:54,798 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:05:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:54,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:54,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:05:54,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:54,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:05:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:05:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:05:54,859 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 07:05:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:56,960 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 07:05:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:05:56,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-11-07 07:05:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:56,970 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 07:05:56,971 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 07:05:56,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:05:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 07:05:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 07:05:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 07:05:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 07:05:57,036 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 122 [2018-11-07 07:05:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:57,036 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 07:05:57,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:05:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 07:05:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 07:05:57,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:57,044 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:57,044 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:57,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -289707029, now seen corresponding path program 1 times [2018-11-07 07:05:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:57,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:57,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:57,252 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:57,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:57,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:57,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:57,258 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 3 states. [2018-11-07 07:05:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:59,347 INFO L93 Difference]: Finished difference Result 1919 states and 3096 transitions. [2018-11-07 07:05:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:59,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-07 07:05:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:59,366 INFO L225 Difference]: With dead ends: 1919 [2018-11-07 07:05:59,404 INFO L226 Difference]: Without dead ends: 1192 [2018-11-07 07:05:59,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-11-07 07:05:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2018-11-07 07:05:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-11-07 07:05:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1735 transitions. [2018-11-07 07:05:59,476 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1735 transitions. Word has length 132 [2018-11-07 07:05:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:59,477 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1735 transitions. [2018-11-07 07:05:59,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1735 transitions. [2018-11-07 07:05:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:05:59,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:59,488 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:59,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:59,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382030, now seen corresponding path program 1 times [2018-11-07 07:05:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:59,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:59,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:59,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:59,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:59,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-11-07 07:05:59,760 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:59,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:59,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:00,618 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:00,619 INFO L272 AbstractInterpreter]: Visited 116 different actions 225 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:06:00,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:00,668 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:01,132 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 81.83% of their original sizes. [2018-11-07 07:06:01,133 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:01,513 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-11-07 07:06:01,514 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:01,515 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:01,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:01,516 INFO L87 Difference]: Start difference. First operand 1192 states and 1735 transitions. Second operand 10 states. [2018-11-07 07:06:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:11,177 INFO L93 Difference]: Finished difference Result 3717 states and 5365 transitions. [2018-11-07 07:06:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 07:06:11,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2018-11-07 07:06:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:11,191 INFO L225 Difference]: With dead ends: 3717 [2018-11-07 07:06:11,191 INFO L226 Difference]: Without dead ends: 2531 [2018-11-07 07:06:11,198 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-07 07:06:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2018-11-07 07:06:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2500. [2018-11-07 07:06:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-11-07 07:06:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3214 transitions. [2018-11-07 07:06:11,285 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3214 transitions. Word has length 134 [2018-11-07 07:06:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:11,286 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 3214 transitions. [2018-11-07 07:06:11,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3214 transitions. [2018-11-07 07:06:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 07:06:11,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:11,295 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:11,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:11,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash -521176307, now seen corresponding path program 1 times [2018-11-07 07:06:11,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:11,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:11,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:06:11,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:11,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:11,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-07 07:06:11,546 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:11,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:11,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:11,775 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:11,775 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:06:11,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:11,803 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:11,992 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 81.79% of their original sizes. [2018-11-07 07:06:11,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:12,138 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-07 07:06:12,139 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:12,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:12,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:12,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:12,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:12,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:12,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:12,141 INFO L87 Difference]: Start difference. First operand 2500 states and 3214 transitions. Second operand 10 states. [2018-11-07 07:06:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:18,762 INFO L93 Difference]: Finished difference Result 4999 states and 6497 transitions. [2018-11-07 07:06:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:18,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 147 [2018-11-07 07:06:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:18,775 INFO L225 Difference]: With dead ends: 4999 [2018-11-07 07:06:18,776 INFO L226 Difference]: Without dead ends: 2641 [2018-11-07 07:06:18,784 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2018-11-07 07:06:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2638. [2018-11-07 07:06:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2018-11-07 07:06:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3368 transitions. [2018-11-07 07:06:18,853 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3368 transitions. Word has length 147 [2018-11-07 07:06:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:18,853 INFO L480 AbstractCegarLoop]: Abstraction has 2638 states and 3368 transitions. [2018-11-07 07:06:18,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3368 transitions. [2018-11-07 07:06:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 07:06:18,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:18,861 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:18,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:18,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash 644918266, now seen corresponding path program 1 times [2018-11-07 07:06:18,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:18,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:18,863 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:06:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:19,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:19,023 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-11-07 07:06:19,024 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:19,029 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:19,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:19,310 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:19,310 INFO L272 AbstractInterpreter]: Visited 118 different actions 352 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:19,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:19,319 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:19,535 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 83.57% of their original sizes. [2018-11-07 07:06:19,536 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:19,618 INFO L415 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-11-07 07:06:19,618 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:19,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:19,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-07 07:06:19,618 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:19,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:06:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:06:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:06:19,619 INFO L87 Difference]: Start difference. First operand 2638 states and 3368 transitions. Second operand 9 states. [2018-11-07 07:06:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:24,802 INFO L93 Difference]: Finished difference Result 5843 states and 7691 transitions. [2018-11-07 07:06:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 07:06:24,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2018-11-07 07:06:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:24,817 INFO L225 Difference]: With dead ends: 5843 [2018-11-07 07:06:24,817 INFO L226 Difference]: Without dead ends: 3485 [2018-11-07 07:06:24,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 165 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 07:06:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-11-07 07:06:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3440. [2018-11-07 07:06:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-11-07 07:06:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4362 transitions. [2018-11-07 07:06:24,906 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4362 transitions. Word has length 159 [2018-11-07 07:06:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:24,906 INFO L480 AbstractCegarLoop]: Abstraction has 3440 states and 4362 transitions. [2018-11-07 07:06:24,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:06:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4362 transitions. [2018-11-07 07:06:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-07 07:06:24,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:24,915 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:24,915 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:24,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1387665827, now seen corresponding path program 1 times [2018-11-07 07:06:24,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:24,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 07:06:25,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:25,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:25,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-11-07 07:06:25,012 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:25,017 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:25,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:25,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:25,518 INFO L272 AbstractInterpreter]: Visited 120 different actions 598 times. Merged at 10 different actions 45 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-07 07:06:25,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:25,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:25,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:25,523 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:25,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:25,533 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:25,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 07:06:25,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 07:06:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:26,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 07:06:26,895 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 07:06:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 07:06:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:06:26,896 INFO L87 Difference]: Start difference. First operand 3440 states and 4362 transitions. Second operand 8 states. [2018-11-07 07:06:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:33,358 INFO L93 Difference]: Finished difference Result 12825 states and 17533 transitions. [2018-11-07 07:06:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 07:06:33,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2018-11-07 07:06:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:33,391 INFO L225 Difference]: With dead ends: 12825 [2018-11-07 07:06:33,391 INFO L226 Difference]: Without dead ends: 5603 [2018-11-07 07:06:33,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 07:06:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2018-11-07 07:06:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5512. [2018-11-07 07:06:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2018-11-07 07:06:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 6499 transitions. [2018-11-07 07:06:33,605 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 6499 transitions. Word has length 179 [2018-11-07 07:06:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:33,605 INFO L480 AbstractCegarLoop]: Abstraction has 5512 states and 6499 transitions. [2018-11-07 07:06:33,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 07:06:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 6499 transitions. [2018-11-07 07:06:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-07 07:06:33,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:33,619 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:33,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:33,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1042057633, now seen corresponding path program 1 times [2018-11-07 07:06:33,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:33,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:33,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:33,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:34,097 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 07:06:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 07:06:34,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:34,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:34,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-11-07 07:06:34,124 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:34,128 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:34,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:34,372 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:34,373 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:06:34,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:34,415 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:34,683 INFO L227 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 81.75% of their original sizes. [2018-11-07 07:06:34,684 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:34,862 INFO L415 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2018-11-07 07:06:34,862 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:34,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:34,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:34,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:34,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:34,864 INFO L87 Difference]: Start difference. First operand 5512 states and 6499 transitions. Second operand 10 states. [2018-11-07 07:06:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:39,523 INFO L93 Difference]: Finished difference Result 11205 states and 13218 transitions. [2018-11-07 07:06:39,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:06:39,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2018-11-07 07:06:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:39,547 INFO L225 Difference]: With dead ends: 11205 [2018-11-07 07:06:39,548 INFO L226 Difference]: Without dead ends: 5973 [2018-11-07 07:06:39,560 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:06:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2018-11-07 07:06:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5970. [2018-11-07 07:06:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5970 states. [2018-11-07 07:06:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5970 states to 5970 states and 6988 transitions. [2018-11-07 07:06:39,684 INFO L78 Accepts]: Start accepts. Automaton has 5970 states and 6988 transitions. Word has length 180 [2018-11-07 07:06:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:39,685 INFO L480 AbstractCegarLoop]: Abstraction has 5970 states and 6988 transitions. [2018-11-07 07:06:39,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5970 states and 6988 transitions. [2018-11-07 07:06:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-07 07:06:39,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:39,699 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:39,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:39,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 660025092, now seen corresponding path program 1 times [2018-11-07 07:06:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:39,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:39,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-07 07:06:39,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:39,972 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:39,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-07 07:06:39,973 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:39,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:39,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:40,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:40,361 INFO L272 AbstractInterpreter]: Visited 119 different actions 474 times. Merged at 9 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:40,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:40,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:40,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:40,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:40,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:40,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 07:06:40,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 07:06:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 07:06:40,893 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:40,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:06:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:06:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 07:06:40,895 INFO L87 Difference]: Start difference. First operand 5970 states and 6988 transitions. Second operand 11 states. [2018-11-07 07:06:41,304 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-07 07:06:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:43,426 INFO L93 Difference]: Finished difference Result 12666 states and 15054 transitions. [2018-11-07 07:06:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:43,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2018-11-07 07:06:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:43,464 INFO L225 Difference]: With dead ends: 12666 [2018-11-07 07:06:43,464 INFO L226 Difference]: Without dead ends: 7296 [2018-11-07 07:06:43,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2018-11-07 07:06:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 7139. [2018-11-07 07:06:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7139 states. [2018-11-07 07:06:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 8276 transitions. [2018-11-07 07:06:43,661 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 8276 transitions. Word has length 189 [2018-11-07 07:06:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:43,662 INFO L480 AbstractCegarLoop]: Abstraction has 7139 states and 8276 transitions. [2018-11-07 07:06:43,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:06:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 8276 transitions. [2018-11-07 07:06:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 07:06:43,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:43,677 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 07:06:43,677 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:43,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2084128074, now seen corresponding path program 1 times [2018-11-07 07:06:43,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:43,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:43,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:44,290 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 07:06:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 98 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 07:06:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:44,428 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:44,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-07 07:06:44,428 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:44,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:44,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:44,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:44,640 INFO L272 AbstractInterpreter]: Visited 118 different actions 346 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 07:06:44,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:44,649 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:44,914 INFO L227 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 83.38% of their original sizes. [2018-11-07 07:06:44,915 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:45,090 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-07 07:06:45,091 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:45,092 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:45,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:45,093 INFO L87 Difference]: Start difference. First operand 7139 states and 8276 transitions. Second operand 10 states. [2018-11-07 07:06:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:49,209 INFO L93 Difference]: Finished difference Result 13963 states and 16267 transitions. [2018-11-07 07:06:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:49,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2018-11-07 07:06:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:49,231 INFO L225 Difference]: With dead ends: 13963 [2018-11-07 07:06:49,231 INFO L226 Difference]: Without dead ends: 7562 [2018-11-07 07:06:49,243 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7562 states. [2018-11-07 07:06:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7562 to 7555. [2018-11-07 07:06:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7555 states. [2018-11-07 07:06:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 8733 transitions. [2018-11-07 07:06:49,406 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 8733 transitions. Word has length 198 [2018-11-07 07:06:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:49,406 INFO L480 AbstractCegarLoop]: Abstraction has 7555 states and 8733 transitions. [2018-11-07 07:06:49,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 8733 transitions. [2018-11-07 07:06:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-07 07:06:49,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:49,423 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 07:06:49,424 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:49,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:49,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1822184039, now seen corresponding path program 1 times [2018-11-07 07:06:49,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:49,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 98 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-07 07:06:49,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:49,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:49,969 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-07 07:06:49,969 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:49,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:49,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:50,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:50,306 INFO L272 AbstractInterpreter]: Visited 120 different actions 481 times. Merged at 10 different actions 37 times. Never widened. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-07 07:06:50,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:50,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:50,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:50,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:50,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:50,323 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:50,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 07:06:50,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 104 proven. 20 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 07:06:50,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 07:06:50,698 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:50,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:06:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:06:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 07:06:50,699 INFO L87 Difference]: Start difference. First operand 7555 states and 8733 transitions. Second operand 12 states. [2018-11-07 07:06:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:55,554 INFO L93 Difference]: Finished difference Result 18363 states and 22223 transitions. [2018-11-07 07:06:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 07:06:55,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 209 [2018-11-07 07:06:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:55,590 INFO L225 Difference]: With dead ends: 18363 [2018-11-07 07:06:55,590 INFO L226 Difference]: Without dead ends: 10734 [2018-11-07 07:06:55,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=468, Invalid=1788, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 07:06:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10734 states. [2018-11-07 07:06:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10734 to 10466. [2018-11-07 07:06:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2018-11-07 07:06:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 12353 transitions. [2018-11-07 07:06:55,863 INFO L78 Accepts]: Start accepts. Automaton has 10466 states and 12353 transitions. Word has length 209 [2018-11-07 07:06:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:55,863 INFO L480 AbstractCegarLoop]: Abstraction has 10466 states and 12353 transitions. [2018-11-07 07:06:55,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:06:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10466 states and 12353 transitions. [2018-11-07 07:06:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 07:06:55,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:55,891 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-11-07 07:06:55,891 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:55,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash -637261400, now seen corresponding path program 1 times [2018-11-07 07:06:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:55,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:55,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 153 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 07:06:56,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:56,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:56,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-07 07:06:56,530 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:56,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:56,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:56,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:56,915 INFO L272 AbstractInterpreter]: Visited 119 different actions 475 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:56,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:56,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:56,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:56,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:56,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:56,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:57,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 07:06:57,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 07:06:57,418 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:57,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 07:06:57,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:57,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:06:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:06:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:57,420 INFO L87 Difference]: Start difference. First operand 10466 states and 12353 transitions. Second operand 3 states. [2018-11-07 07:06:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:58,013 INFO L93 Difference]: Finished difference Result 16334 states and 19372 transitions. [2018-11-07 07:06:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:06:58,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-07 07:06:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:58,020 INFO L225 Difference]: With dead ends: 16334 [2018-11-07 07:06:58,020 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:06:58,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:06:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:06:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:06:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:06:58,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2018-11-07 07:06:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:58,055 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:06:58,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:06:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:06:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:06:58,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:06:58,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,839 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 146 [2018-11-07 07:06:58,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:58,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:59,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:59,008 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 83 [2018-11-07 07:06:59,475 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-07 07:07:00,420 WARN L179 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-11-07 07:07:04,919 WARN L179 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 307 DAG size of output: 126 [2018-11-07 07:07:06,099 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 150 DAG size of output: 73 [2018-11-07 07:07:06,926 WARN L179 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-11-07 07:07:06,929 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:07:06,930 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|)) [2018-11-07 07:07:06,930 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:07:06,930 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:07:06,930 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,931 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:07:06,932 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:07:06,933 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,934 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,935 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:07:06,936 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,937 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:07:06,943 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:07:06,944 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,945 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,946 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:07:06,947 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:07:06,948 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse32 (= ~a16~0 6))) (let ((.cse9 (= ~a7~0 |old(~a7~0)|)) (.cse35 (not (= 0 |old(~a17~0)|))) (.cse33 (not (= 0 |old(~a7~0)|))) (.cse5 (not (= 1 |old(~a21~0)|))) (.cse34 (not (= 15 |old(~a8~0)|))) (.cse14 (not (= 8 ~a12~0))) (.cse19 (not (= 1 |old(~a17~0)|))) (.cse7 (= |old(~a20~0)| ~a20~0)) (.cse11 (= ~a17~0 |old(~a17~0)|)) (.cse25 (= 1 ~a7~0)) (.cse10 (= |old(~a8~0)| ~a8~0)) (.cse4 (not .cse32))) (let ((.cse28 (< |old(~a8~0)| 15)) (.cse29 (= 1 ~a20~0)) (.cse27 (and .cse25 .cse10 .cse4)) (.cse23 (= ~a16~0 5)) (.cse22 (not (= |old(~a20~0)| 1))) (.cse21 (= ~a17~0 1)) (.cse20 (< 13 |old(~a8~0)|)) (.cse26 (and .cse25 .cse10 .cse7 .cse11 .cse4)) (.cse24 (let ((.cse36 (not (= 5 |old(~a16~0)|)))) (and (or .cse33 .cse5 .cse34 .cse35 .cse36 .cse14) (or .cse33 .cse5 .cse34 .cse36 .cse14 .cse19)))) (.cse6 (not (= ~a16~0 0))) (.cse8 (= ~a21~0 1)) (.cse12 (= 13 |old(~a8~0)|)) (.cse31 (and .cse9 .cse10 .cse7 .cse11)) (.cse18 (< 0 |old(~a20~0)|)) (.cse0 (= 6 |old(~a16~0)|)) (.cse15 (< 0 |old(~a7~0)|)) (.cse3 (< 0 |old(~a17~0)|)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse30 (= ~a20~0 1)) (.cse13 (= 0 |old(~a16~0)|)) (.cse2 (not (= 1 |old(~a7~0)|))) (.cse16 (= |calculate_output_#in~input| 0)) (.cse17 (= 0 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse5 .cse20 (and .cse6 .cse21 .cse8) .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse22 .cse23 .cse16 .cse24) (or .cse0 .cse15 .cse3 .cse4 .cse18) (or (and .cse25 .cse10 .cse7 .cse11) .cse22 .cse2 .cse3) (or .cse0 .cse26 .cse2 .cse3 .cse18) (or .cse0 .cse27 .cse2 .cse28) (or .cse0 (and .cse7 .cse11) .cse15 .cse3 .cse18) (or .cse0 (= |old(~a7~0)| 1) .cse20 (and .cse9 .cse10 .cse4)) (or .cse0 .cse5 .cse13 .cse14 .cse4 .cse15 .cse16 .cse18 .cse19) (or .cse0 .cse26 .cse20 .cse1 .cse2) (or .cse1 (and .cse25 .cse10 .cse29) .cse2 .cse28) (or .cse29 .cse0 .cse20 .cse1) (or .cse0 .cse5 .cse27 .cse13 .cse14 .cse2 .cse16 .cse17 .cse19) (or .cse16 .cse23 .cse24 .cse18) (or .cse5 (and .cse6 .cse25 .cse10 .cse21 .cse8) .cse12 .cse13 .cse14 .cse2 .cse16 .cse17 .cse19) (or .cse0 .cse5 .cse1 .cse13 .cse14 .cse15 .cse16 (and .cse6 .cse8 .cse9 .cse10 .cse11 .cse4 .cse30) .cse17 .cse19) (or .cse0 .cse4 .cse22 .cse15 .cse3) (or .cse1 .cse31 .cse12 .cse15 .cse3) (or .cse5 .cse20 (and .cse9 .cse6 .cse10 .cse21 .cse8 .cse30) .cse1 .cse13 .cse14 .cse16 .cse17 .cse19) (or (or .cse5 .cse1 (not (= 4 |old(~a16~0)|)) (not .cse12)) (= ~a16~0 4) .cse14 .cse2 .cse16 .cse19) (or .cse0 .cse20 .cse26 .cse2 .cse18) (or (and .cse8 .cse32) .cse16 (or (not .cse0) .cse33 .cse5 .cse1 .cse34 .cse35 .cse14)) (or .cse8 .cse16 .cse24 .cse18) (or .cse0 .cse33 .cse5 .cse14 .cse3 .cse16 (and .cse6 .cse8) .cse1 .cse34 .cse13) (or .cse12 .cse15 .cse3 .cse31 .cse18) (or .cse0 .cse1 .cse11 .cse15 .cse3) (or .cse5 .cse1 .cse30 .cse13 .cse14 .cse2 .cse16 .cse17 .cse19))))) [2018-11-07 07:07:06,948 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:07:06,948 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,948 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,948 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,948 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:07:06,949 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,950 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:07:06,951 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:07:06,952 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:07:06,952 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,953 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:07:06,954 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:07:06,955 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:07:06,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:07:06,955 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 07:07:06,955 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:07:06,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:07:06,955 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (and (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 1 |old(~a17~0)|))) [2018-11-07 07:07:06,955 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:07:06,956 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse14 (<= ~a8~0 |old(~a8~0)|)) (.cse15 (<= 15 ~a8~0)) (.cse13 (= 1 ~a20~0)) (.cse2 (<= ~a17~0 0)) (.cse11 (not (= ~a8~0 13))) (.cse9 (<= ~a7~0 0)) (.cse4 (not (= ~a16~0 0))) (.cse5 (not (= main_~input~0 0))) (.cse6 (not (= ~a8~0 0))) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a21~0 1)) (.cse10 (= ~a20~0 1)) (.cse12 (<= ~a8~0 13)) (.cse0 (= 1 ~a7~0)) (.cse1 (not (= ~a16~0 6))) (.cse3 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (= 8 ~a12~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse3 .cse9) (and .cse12 .cse4 .cse5 .cse6 .cse1 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse9) (and .cse12 .cse0 .cse13 .cse1) (and .cse14 .cse0 .cse15 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse14 .cse0 .cse15 .cse13) (and .cse2 .cse11 .cse3 .cse9) (and .cse12 (= ~a7~0 |old(~a7~0)|) .cse1) (and .cse13 .cse1 .cse2 .cse9) (and .cse0 .cse13 .cse2) (and (= |old(~a20~0)| ~a20~0) .cse2 .cse11 .cse9) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse12 .cse0 .cse1 .cse3))) [2018-11-07 07:07:06,956 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:07:06,956 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:07:06,956 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:07:06,956 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (<= ~a8~0 |old(~a8~0)|)) (.cse8 (<= 15 ~a8~0)) (.cse6 (= 1 ~a20~0)) (.cse2 (<= ~a17~0 0)) (.cse4 (<= ~a7~0 0)) (.cse9 (not (= ~a8~0 13))) (.cse10 (not (= ~a16~0 0))) (.cse11 (not (= ~a8~0 0))) (.cse12 (= ~a17~0 1)) (.cse14 (= ~a20~0 1)) (.cse13 (= ~a21~0 1)) (.cse5 (<= ~a8~0 13)) (.cse0 (= 1 ~a7~0)) (.cse1 (not (= ~a16~0 6))) (.cse3 (<= ~a20~0 0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse1) (and .cse7 .cse0 .cse8 .cse1) (and .cse7 .cse0 .cse8 .cse6) (and .cse5 (= ~a7~0 |old(~a7~0)|) .cse1) (and .cse6 .cse1 .cse2 .cse4) (and (= |old(~a20~0)| ~a20~0) .cse2 .cse9 .cse4) (and .cse5 .cse10 .cse11 .cse1 .cse12 .cse13) (and (and .cse10 .cse11 .cse1 .cse12 .cse13 .cse14) .cse4) (and .cse10 .cse0 .cse11 .cse12 .cse13 .cse9) (and .cse0 .cse6 .cse2) (not (= 0 |old(~a7~0)|)) (and .cse2 .cse9 .cse3 .cse4) (not (= 1 |old(~a17~0)|)) (and .cse10 .cse11 .cse12 .cse13 .cse3 .cse4 .cse9) (not (= 15 |old(~a8~0)|)) (and .cse5 .cse10 .cse11 .cse12 .cse14 .cse13) (and .cse5 .cse0 .cse1 .cse3))) [2018-11-07 07:07:06,956 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:07:06,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:07:06 BoogieIcfgContainer [2018-11-07 07:07:06,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:07:06,990 INFO L168 Benchmark]: Toolchain (without parser) took 79163.64 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 07:07:06,991 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:07:06,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 07:07:06,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-07 07:07:06,995 INFO L168 Benchmark]: Boogie Preprocessor took 120.27 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:07:06,995 INFO L168 Benchmark]: RCFGBuilder took 3156.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:07:06,997 INFO L168 Benchmark]: TraceAbstraction took 75011.51 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-07 07:07:07,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.07 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 129.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.27 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3156.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.4 MB). Peak memory consumption was 106.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75011.51 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 491]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == \old(a21)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a20 <= 0)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((!(a16 == 6) && a17 <= 0) && a20 <= 0) && a7 <= 0)) || (((a8 <= 13 && 1 == a7) && 1 == a20) && !(a16 == 6))) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && 1 == a20)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || (((1 == a20 && !(a16 == 6)) && a17 <= 0) && a7 <= 0)) || (((\old(a20) == a20 && a17 <= 0) && !(a8 == 13)) && a7 <= 0)) || (((((a8 <= 13 && !(a16 == 0)) && !(a8 == 0)) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((((!(a16 == 0) && !(a8 == 0)) && !(a16 == 6)) && a17 == 1) && a21 == 1) && a20 == 1) && a7 <= 0)) || (((((!(a16 == 0) && 1 == a7) && !(a8 == 0)) && a17 == 1) && a21 == 1) && !(a8 == 13))) || ((1 == a7 && 1 == a20) && a17 <= 0)) || !(0 == \old(a7))) || (((a17 <= 0 && !(a8 == 13)) && a20 <= 0) && a7 <= 0)) || !(1 == \old(a17))) || ((((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a21 == 1) && a20 <= 0) && a7 <= 0) && !(a8 == 13))) || !(15 == \old(a8))) || (((((a8 <= 13 && !(a16 == 0)) && !(a8 == 0)) && a17 == 1) && a20 == 1) && a21 == 1)) || (((a8 <= 13 && 1 == a7) && !(a16 == 6)) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 74.9s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 50.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1493 SDtfs, 13000 SDslu, 2381 SDs, 0 SdLazy, 14508 SolverSat, 3010 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.8s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2604 GetRequests, 2407 SyntacticMatches, 8 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10466occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9962800323049066 AbsIntWeakeningRatio, 0.25953259532595324 AbsIntAvgWeakeningVarsNumRemoved, 27.215252152521526 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 617 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 444 PreInvPairs, 728 NumberOfFragments, 1711 HoareAnnotationTreeSize, 444 FomulaSimplifications, 21169 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9151 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2766 NumberOfCodeBlocks, 2766 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3537 ConstructedInterpolants, 0 QuantifiedInterpolants, 1235806 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2463 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 2193/2446 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...