java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:01:59,913 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:01:59,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:01:59,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:01:59,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:01:59,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:01:59,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:01:59,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:01:59,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:01:59,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:01:59,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:01:59,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:01:59,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:01:59,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:01:59,938 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:01:59,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:01:59,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:01:59,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:01:59,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:01:59,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:01:59,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:01:59,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:01:59,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:01:59,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:01:59,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:01:59,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:01:59,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:01:59,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:01:59,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:01:59,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:01:59,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:01:59,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:01:59,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:01:59,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:01:59,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:01:59,963 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:01:59,963 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:01:59,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:01:59,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:01:59,996 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:01:59,996 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:01:59,997 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:01:59,997 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:01:59,997 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:01:59,997 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:01:59,997 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:01:59,998 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:01:59,998 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:01:59,998 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:01:59,998 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:01:59,998 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:01:59,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:01:59,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:01:59,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:02:00,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:02:00,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:02:00,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:02:00,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:02:00,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:02:00,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:02:00,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:02:00,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:02:00,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:02:00,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:00,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:02:00,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:02:00,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:02:00,002 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:02:00,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:02:00,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:02:00,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:02:00,003 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:02:00,003 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:02:00,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:02:00,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:02:00,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:02:00,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:02:00,089 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:02:00,090 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-25 00:02:00,158 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95aaafa30/c15a1acd9c864e8498bee44a1961230d/FLAGe33f5752a [2018-10-25 00:02:00,721 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:02:00,723 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2018-10-25 00:02:00,748 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95aaafa30/c15a1acd9c864e8498bee44a1961230d/FLAGe33f5752a [2018-10-25 00:02:00,764 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/95aaafa30/c15a1acd9c864e8498bee44a1961230d [2018-10-25 00:02:00,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:02:00,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:02:00,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:00,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:02:00,783 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:02:00,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:00" (1/1) ... [2018-10-25 00:02:00,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2701909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:00, skipping insertion in model container [2018-10-25 00:02:00,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:02:00" (1/1) ... [2018-10-25 00:02:00,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:02:00,859 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:02:01,307 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:01,323 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:02:01,462 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:02:01,480 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:02:01,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01 WrapperNode [2018-10-25 00:02:01,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:02:01,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:01,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:02:01,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:02:01,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:02:01,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:02:01,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:02:01,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:02:01,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... [2018-10-25 00:02:01,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:02:01,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:02:01,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:02:01,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:02:01,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:02:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:02:01,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:02:01,867 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:02:01,867 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:02:01,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:02:01,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:02:01,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:02:01,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:02:04,943 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:02:04,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:04 BoogieIcfgContainer [2018-10-25 00:02:04,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:02:04,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:02:04,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:02:04,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:02:04,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:02:00" (1/3) ... [2018-10-25 00:02:04,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47122f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:04, skipping insertion in model container [2018-10-25 00:02:04,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:02:01" (2/3) ... [2018-10-25 00:02:04,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47122f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:02:04, skipping insertion in model container [2018-10-25 00:02:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:02:04" (3/3) ... [2018-10-25 00:02:04,958 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27_true-unreach-call_false-termination.c [2018-10-25 00:02:04,968 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:02:04,984 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:02:05,003 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:02:05,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:02:05,056 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:02:05,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:02:05,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:02:05,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:02:05,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:02:05,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:02:05,058 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:02:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:02:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-25 00:02:05,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:05,117 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] [2018-10-25 00:02:05,122 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:05,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 933673069, now seen corresponding path program 1 times [2018-10-25 00:02:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:05,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:05,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:05,733 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:02:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:05,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:05,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:02:05,908 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:05,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:02:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:02:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:02:05,934 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-10-25 00:02:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:08,066 INFO L93 Difference]: Finished difference Result 702 states and 1227 transitions. [2018-10-25 00:02:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:02:08,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-10-25 00:02:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:08,091 INFO L225 Difference]: With dead ends: 702 [2018-10-25 00:02:08,091 INFO L226 Difference]: Without dead ends: 488 [2018-10-25 00:02:08,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:02:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-25 00:02:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 340. [2018-10-25 00:02:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:02:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 565 transitions. [2018-10-25 00:02:08,180 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 565 transitions. Word has length 95 [2018-10-25 00:02:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:08,181 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 565 transitions. [2018-10-25 00:02:08,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:02:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 565 transitions. [2018-10-25 00:02:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-25 00:02:08,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:08,188 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:08,188 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:08,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2037295790, now seen corresponding path program 1 times [2018-10-25 00:02:08,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:08,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:08,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:08,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:08,382 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:08,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:08,385 INFO L87 Difference]: Start difference. First operand 340 states and 565 transitions. Second operand 6 states. [2018-10-25 00:02:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:11,076 INFO L93 Difference]: Finished difference Result 1070 states and 1865 transitions. [2018-10-25 00:02:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:11,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-10-25 00:02:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:11,092 INFO L225 Difference]: With dead ends: 1070 [2018-10-25 00:02:11,092 INFO L226 Difference]: Without dead ends: 736 [2018-10-25 00:02:11,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-25 00:02:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 719. [2018-10-25 00:02:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-10-25 00:02:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1163 transitions. [2018-10-25 00:02:11,167 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1163 transitions. Word has length 106 [2018-10-25 00:02:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:11,168 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1163 transitions. [2018-10-25 00:02:11,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1163 transitions. [2018-10-25 00:02:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-25 00:02:11,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:11,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:11,174 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:11,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 420402650, now seen corresponding path program 1 times [2018-10-25 00:02:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:11,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:11,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:11,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:11,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:02:11,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:11,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:02:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:02:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:02:11,364 INFO L87 Difference]: Start difference. First operand 719 states and 1163 transitions. Second operand 3 states. [2018-10-25 00:02:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:13,829 INFO L93 Difference]: Finished difference Result 2065 states and 3447 transitions. [2018-10-25 00:02:13,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:02:13,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-25 00:02:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:13,847 INFO L225 Difference]: With dead ends: 2065 [2018-10-25 00:02:13,847 INFO L226 Difference]: Without dead ends: 1352 [2018-10-25 00:02:13,851 INFO L605 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-10-25 00:02:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-10-25 00:02:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1345. [2018-10-25 00:02:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-10-25 00:02:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2085 transitions. [2018-10-25 00:02:13,919 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2085 transitions. Word has length 107 [2018-10-25 00:02:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:13,920 INFO L481 AbstractCegarLoop]: Abstraction has 1345 states and 2085 transitions. [2018-10-25 00:02:13,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:02:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2085 transitions. [2018-10-25 00:02:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 00:02:13,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:13,933 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:13,933 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:13,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash -820743182, now seen corresponding path program 1 times [2018-10-25 00:02:13,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:13,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:13,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:13,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:14,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:02:14,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:02:14,142 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:14,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:02:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:02:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:02:14,143 INFO L87 Difference]: Start difference. First operand 1345 states and 2085 transitions. Second operand 6 states. [2018-10-25 00:02:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:16,177 INFO L93 Difference]: Finished difference Result 4143 states and 6680 transitions. [2018-10-25 00:02:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:02:16,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-10-25 00:02:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:16,211 INFO L225 Difference]: With dead ends: 4143 [2018-10-25 00:02:16,211 INFO L226 Difference]: Without dead ends: 2804 [2018-10-25 00:02:16,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:02:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2018-10-25 00:02:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2778. [2018-10-25 00:02:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-10-25 00:02:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4132 transitions. [2018-10-25 00:02:16,316 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4132 transitions. Word has length 119 [2018-10-25 00:02:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:16,316 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 4132 transitions. [2018-10-25 00:02:16,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:02:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4132 transitions. [2018-10-25 00:02:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 00:02:16,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:16,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:16,322 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1178183073, now seen corresponding path program 1 times [2018-10-25 00:02:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:16,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:16,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:16,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:16,464 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-10-25 00:02:16,466 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [65], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:16,517 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:16,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:17,518 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:17,520 INFO L272 AbstractInterpreter]: Visited 99 different actions 191 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:17,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:17,558 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:18,506 INFO L232 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 80.44% of their original sizes. [2018-10-25 00:02:18,506 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:21,534 INFO L413 sIntCurrentIteration]: We have 130 unified AI predicates [2018-10-25 00:02:21,535 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:21,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:21,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:02:21,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:21,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:02:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:02:21,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:02:21,537 INFO L87 Difference]: Start difference. First operand 2778 states and 4132 transitions. Second operand 15 states. [2018-10-25 00:02:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:39,211 INFO L93 Difference]: Finished difference Result 7219 states and 10548 transitions. [2018-10-25 00:02:39,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:02:39,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 131 [2018-10-25 00:02:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:39,235 INFO L225 Difference]: With dead ends: 7219 [2018-10-25 00:02:39,236 INFO L226 Difference]: Without dead ends: 4447 [2018-10-25 00:02:39,251 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 137 GetRequests, 34 SyntacticMatches, 83 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:02:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2018-10-25 00:02:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4384. [2018-10-25 00:02:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4384 states. [2018-10-25 00:02:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4384 states to 4384 states and 5774 transitions. [2018-10-25 00:02:39,381 INFO L78 Accepts]: Start accepts. Automaton has 4384 states and 5774 transitions. Word has length 131 [2018-10-25 00:02:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:39,381 INFO L481 AbstractCegarLoop]: Abstraction has 4384 states and 5774 transitions. [2018-10-25 00:02:39,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:02:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4384 states and 5774 transitions. [2018-10-25 00:02:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 00:02:39,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:39,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:39,390 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:39,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1279739647, now seen corresponding path program 1 times [2018-10-25 00:02:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:39,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:02:39,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:39,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:39,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-10-25 00:02:39,549 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:39,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:39,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:39,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:39,826 INFO L272 AbstractInterpreter]: Visited 99 different actions 192 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:02:39,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:39,836 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:40,458 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.16% of their original sizes. [2018-10-25 00:02:40,458 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:40,581 INFO L413 sIntCurrentIteration]: We have 138 unified AI predicates [2018-10-25 00:02:40,581 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:02:40,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:40,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:02:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:02:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:02:40,584 INFO L87 Difference]: Start difference. First operand 4384 states and 5774 transitions. Second operand 10 states. [2018-10-25 00:02:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:02:47,721 INFO L93 Difference]: Finished difference Result 8435 states and 11220 transitions. [2018-10-25 00:02:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:02:47,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2018-10-25 00:02:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:02:47,742 INFO L225 Difference]: With dead ends: 8435 [2018-10-25 00:02:47,742 INFO L226 Difference]: Without dead ends: 4525 [2018-10-25 00:02:47,757 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 130 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-10-25 00:02:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2018-10-25 00:02:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4522. [2018-10-25 00:02:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4522 states. [2018-10-25 00:02:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 5927 transitions. [2018-10-25 00:02:47,870 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 5927 transitions. Word has length 139 [2018-10-25 00:02:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:02:47,871 INFO L481 AbstractCegarLoop]: Abstraction has 4522 states and 5927 transitions. [2018-10-25 00:02:47,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:02:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 5927 transitions. [2018-10-25 00:02:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-25 00:02:47,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:02:47,879 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:02:47,880 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:02:47,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash 630990574, now seen corresponding path program 1 times [2018-10-25 00:02:47,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:02:47,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:47,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:02:47,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:02:47,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:02:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:02:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 59 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-25 00:02:48,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:02:48,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:02:48,009 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-25 00:02:48,009 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [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], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:02:48,014 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:02:48,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:02:48,567 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:02:48,567 INFO L272 AbstractInterpreter]: Visited 100 different actions 303 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:02:48,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:02:48,610 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:02:49,552 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 81.25% of their original sizes. [2018-10-25 00:02:49,552 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:02:53,185 INFO L413 sIntCurrentIteration]: We have 150 unified AI predicates [2018-10-25 00:02:53,185 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:02:53,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:02:53,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-25 00:02:53,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:02:53,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:02:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:02:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:02:53,187 INFO L87 Difference]: Start difference. First operand 4522 states and 5927 transitions. Second operand 12 states. [2018-10-25 00:03:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:08,020 INFO L93 Difference]: Finished difference Result 9747 states and 12713 transitions. [2018-10-25 00:03:08,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:03:08,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-10-25 00:03:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:08,043 INFO L225 Difference]: With dead ends: 9747 [2018-10-25 00:03:08,044 INFO L226 Difference]: Without dead ends: 5837 [2018-10-25 00:03:08,056 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 33 SyntacticMatches, 107 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:03:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5837 states. [2018-10-25 00:03:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5837 to 5810. [2018-10-25 00:03:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5810 states. [2018-10-25 00:03:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5810 states to 5810 states and 7349 transitions. [2018-10-25 00:03:08,208 INFO L78 Accepts]: Start accepts. Automaton has 5810 states and 7349 transitions. Word has length 151 [2018-10-25 00:03:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:08,208 INFO L481 AbstractCegarLoop]: Abstraction has 5810 states and 7349 transitions. [2018-10-25 00:03:08,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:03:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5810 states and 7349 transitions. [2018-10-25 00:03:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-25 00:03:08,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:08,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:03:08,221 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:08,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:08,221 INFO L82 PathProgramCache]: Analyzing trace with hash 798717009, now seen corresponding path program 1 times [2018-10-25 00:03:08,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:08,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:08,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:08,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:08,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:03:08,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:08,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:08,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-10-25 00:03:08,504 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:08,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:08,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:09,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:09,265 INFO L272 AbstractInterpreter]: Visited 102 different actions 415 times. Merged at 9 different actions 43 times. Widened at 1 different actions 3 times. Found 8 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:03:09,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:09,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:09,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:09,276 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:09,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:09,286 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:09,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 62 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:03:09,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:09,880 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:03:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 81 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-25 00:03:10,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:10,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-25 00:03:10,647 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:10,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:03:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:03:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:03:10,648 INFO L87 Difference]: Start difference. First operand 5810 states and 7349 transitions. Second operand 8 states. [2018-10-25 00:03:10,993 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:03:11,505 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:03:11,875 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-25 00:03:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:16,172 INFO L93 Difference]: Finished difference Result 13852 states and 18656 transitions. [2018-10-25 00:03:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-25 00:03:16,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2018-10-25 00:03:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:16,200 INFO L225 Difference]: With dead ends: 13852 [2018-10-25 00:03:16,206 INFO L226 Difference]: Without dead ends: 5021 [2018-10-25 00:03:16,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-10-25 00:03:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2018-10-25 00:03:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 4936. [2018-10-25 00:03:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-10-25 00:03:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 5708 transitions. [2018-10-25 00:03:16,439 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 5708 transitions. Word has length 171 [2018-10-25 00:03:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:16,439 INFO L481 AbstractCegarLoop]: Abstraction has 4936 states and 5708 transitions. [2018-10-25 00:03:16,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:03:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 5708 transitions. [2018-10-25 00:03:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 00:03:16,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:16,453 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:16,453 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:16,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1834458005, now seen corresponding path program 1 times [2018-10-25 00:03:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:16,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:16,455 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:17,095 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-25 00:03:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 78 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:17,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:17,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:17,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-10-25 00:03:17,503 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:17,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:17,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:18,161 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:18,161 INFO L272 AbstractInterpreter]: Visited 99 different actions 192 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:03:18,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:18,199 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:18,992 INFO L232 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 80.4% of their original sizes. [2018-10-25 00:03:18,993 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:22,428 INFO L413 sIntCurrentIteration]: We have 171 unified AI predicates [2018-10-25 00:03:22,428 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:22,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:22,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-10-25 00:03:22,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:22,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:03:22,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:03:22,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:03:22,430 INFO L87 Difference]: Start difference. First operand 4936 states and 5708 transitions. Second operand 15 states. [2018-10-25 00:03:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:34,862 INFO L93 Difference]: Finished difference Result 9970 states and 11612 transitions. [2018-10-25 00:03:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:03:34,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2018-10-25 00:03:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:34,883 INFO L225 Difference]: With dead ends: 9970 [2018-10-25 00:03:34,883 INFO L226 Difference]: Without dead ends: 5587 [2018-10-25 00:03:34,891 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 37 SyntacticMatches, 121 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:03:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2018-10-25 00:03:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5581. [2018-10-25 00:03:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5581 states. [2018-10-25 00:03:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 6399 transitions. [2018-10-25 00:03:35,023 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 6399 transitions. Word has length 172 [2018-10-25 00:03:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:35,023 INFO L481 AbstractCegarLoop]: Abstraction has 5581 states and 6399 transitions. [2018-10-25 00:03:35,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:03:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 6399 transitions. [2018-10-25 00:03:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-25 00:03:35,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:35,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:35,034 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:35,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -78425096, now seen corresponding path program 1 times [2018-10-25 00:03:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:35,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 83 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:35,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:35,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:35,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-10-25 00:03:35,531 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:35,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:35,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:36,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:36,507 INFO L272 AbstractInterpreter]: Visited 101 different actions 406 times. Merged at 8 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:36,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:36,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:36,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:36,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:36,525 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:36,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-25 00:03:36,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:36,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:03:36,894 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:36,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:03:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:03:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:03:36,895 INFO L87 Difference]: Start difference. First operand 5581 states and 6399 transitions. Second operand 11 states. [2018-10-25 00:03:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:39,922 INFO L93 Difference]: Finished difference Result 14962 states and 17991 transitions. [2018-10-25 00:03:39,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 00:03:39,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2018-10-25 00:03:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:39,957 INFO L225 Difference]: With dead ends: 14962 [2018-10-25 00:03:39,958 INFO L226 Difference]: Without dead ends: 10303 [2018-10-25 00:03:39,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:03:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2018-10-25 00:03:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 9853. [2018-10-25 00:03:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9853 states. [2018-10-25 00:03:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9853 states to 9853 states and 11574 transitions. [2018-10-25 00:03:40,219 INFO L78 Accepts]: Start accepts. Automaton has 9853 states and 11574 transitions. Word has length 181 [2018-10-25 00:03:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:40,220 INFO L481 AbstractCegarLoop]: Abstraction has 9853 states and 11574 transitions. [2018-10-25 00:03:40,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:03:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 9853 states and 11574 transitions. [2018-10-25 00:03:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 00:03:40,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:40,236 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:40,236 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:40,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -623201878, now seen corresponding path program 1 times [2018-10-25 00:03:40,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:40,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:40,815 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:03:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 100 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:03:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:40,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:40,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-25 00:03:40,905 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:40,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:40,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:41,304 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:03:41,304 INFO L272 AbstractInterpreter]: Visited 100 different actions 292 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:03:41,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:41,311 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:03:42,097 INFO L232 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 80.79% of their original sizes. [2018-10-25 00:03:42,098 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:03:46,203 INFO L413 sIntCurrentIteration]: We have 189 unified AI predicates [2018-10-25 00:03:46,203 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:03:46,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:03:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:03:46,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:46,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:03:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:03:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:03:46,205 INFO L87 Difference]: Start difference. First operand 9853 states and 11574 transitions. Second operand 13 states. [2018-10-25 00:03:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:56,722 INFO L93 Difference]: Finished difference Result 19897 states and 23463 transitions. [2018-10-25 00:03:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:03:56,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2018-10-25 00:03:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:56,754 INFO L225 Difference]: With dead ends: 19897 [2018-10-25 00:03:56,754 INFO L226 Difference]: Without dead ends: 10969 [2018-10-25 00:03:56,770 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 52 SyntacticMatches, 126 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:03:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10969 states. [2018-10-25 00:03:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10969 to 10962. [2018-10-25 00:03:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10962 states. [2018-10-25 00:03:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 12795 transitions. [2018-10-25 00:03:57,018 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 12795 transitions. Word has length 190 [2018-10-25 00:03:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:57,018 INFO L481 AbstractCegarLoop]: Abstraction has 10962 states and 12795 transitions. [2018-10-25 00:03:57,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:03:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 12795 transitions. [2018-10-25 00:03:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:03:57,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:57,039 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:03:57,040 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:57,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -685885555, now seen corresponding path program 1 times [2018-10-25 00:03:57,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:57,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:57,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 61 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:03:57,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:57,942 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:03:57,943 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 00:03:57,943 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:03:57,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:03:57,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:03:58,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:03:58,779 INFO L272 AbstractInterpreter]: Visited 102 different actions 422 times. Merged at 9 different actions 50 times. Widened at 1 different actions 6 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:03:58,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:58,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:03:58,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:03:58,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:03:58,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:58,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:03:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:58,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:03:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:03:58,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:03:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 111 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 00:03:59,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:03:59,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:03:59,086 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:03:59,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:03:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:03:59,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:03:59,087 INFO L87 Difference]: Start difference. First operand 10962 states and 12795 transitions. Second operand 12 states. [2018-10-25 00:04:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:03,537 INFO L93 Difference]: Finished difference Result 24492 states and 29800 transitions. [2018-10-25 00:04:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-25 00:04:03,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-10-25 00:04:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:03,596 INFO L225 Difference]: With dead ends: 24492 [2018-10-25 00:04:03,596 INFO L226 Difference]: Without dead ends: 14083 [2018-10-25 00:04:03,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=1395, Unknown=0, NotChecked=0, Total=1806 [2018-10-25 00:04:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14083 states. [2018-10-25 00:04:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14083 to 12993. [2018-10-25 00:04:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12993 states. [2018-10-25 00:04:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12993 states to 12993 states and 15450 transitions. [2018-10-25 00:04:03,990 INFO L78 Accepts]: Start accepts. Automaton has 12993 states and 15450 transitions. Word has length 201 [2018-10-25 00:04:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:03,991 INFO L481 AbstractCegarLoop]: Abstraction has 12993 states and 15450 transitions. [2018-10-25 00:04:03,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:04:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 12993 states and 15450 transitions. [2018-10-25 00:04:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 00:04:04,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:04,020 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:04,021 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:04,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1662569828, now seen corresponding path program 1 times [2018-10-25 00:04:04,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:04,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 174 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:04,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:04,412 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:04,413 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-10-25 00:04:04,413 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [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], [397], [399], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:04,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:04,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:05,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:05,139 INFO L272 AbstractInterpreter]: Visited 101 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 6 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:05,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:05,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:05,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:05,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:05,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:05,155 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:05,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-25 00:04:05,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-25 00:04:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:05,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:04:05,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:05,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:05,595 INFO L87 Difference]: Start difference. First operand 12993 states and 15450 transitions. Second operand 3 states. [2018-10-25 00:04:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:06,415 INFO L93 Difference]: Finished difference Result 22334 states and 26912 transitions. [2018-10-25 00:04:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:06,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-10-25 00:04:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:06,416 INFO L225 Difference]: With dead ends: 22334 [2018-10-25 00:04:06,417 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:04:06,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:04:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:04:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:04:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:04:06,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-10-25 00:04:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:06,471 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:04:06,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:04:06,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:04:06,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:04:06,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:06,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:06,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:07,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:08,980 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 436 DAG size of output: 284 [2018-10-25 00:04:09,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:04:09,934 WARN L179 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 257 [2018-10-25 00:04:10,171 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-25 00:04:10,516 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-10-25 00:04:15,822 WARN L179 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 481 DAG size of output: 180 [2018-10-25 00:04:18,524 WARN L179 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 299 DAG size of output: 135 [2018-10-25 00:04:20,538 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 278 DAG size of output: 133 [2018-10-25 00:04:20,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:20,542 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)|) (= |old(~a16~0)| ~a16~0)) [2018-10-25 00:04:20,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,543 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,544 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:04:20,545 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,546 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:04:20,547 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:04:20,548 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,549 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:04:20,550 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,551 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:04:20,552 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,553 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:04:20,554 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:04:20,555 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:04:20,556 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:04:20,556 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:04:20,556 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:04:20,556 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:04:20,556 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse30 (= 1 |old(~a20~0)|))) (let ((.cse28 (= ~a20~0 1)) (.cse31 (not .cse30)) (.cse27 (= |calculate_output_#in~input| 0)) (.cse20 (not (= 1 |old(~a21~0)|))) (.cse32 (= 0 |old(~a16~0)|)) (.cse22 (not (= 8 ~a12~0))) (.cse35 (= 0 |old(~a8~0)|)) (.cse33 (not (= ~a16~0 0))) (.cse34 (not (= ~a8~0 0))) (.cse29 (= ~a17~0 1)) (.cse18 (= ~a21~0 1)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse10 (= |old(~a16~0)| ~a16~0)) (.cse6 (= ~a7~0 |old(~a7~0)|)) (.cse7 (= |old(~a8~0)| ~a8~0)) (.cse26 (= ~a17~0 |old(~a17~0)|))) (let ((.cse0 (and .cse8 .cse10 .cse6 .cse7 .cse26)) (.cse15 (< 14 |old(~a8~0)|)) (.cse1 (= 6 |old(~a16~0)|)) (.cse9 (and .cse33 .cse34 .cse29 .cse18)) (.cse11 (or .cse20 .cse32 .cse22 .cse35)) (.cse19 (not (= 0 |old(~a7~0)|))) (.cse21 (not (= 15 |old(~a8~0)|))) (.cse2 (< 13 |old(~a8~0)|)) (.cse23 (or .cse20 .cse31 .cse32 .cse22 .cse27 .cse35)) (.cse24 (and .cse33 .cse34 .cse28 (not .cse27))) (.cse25 (= 1 ~a17~0)) (.cse4 (not (= 1 |old(~a17~0)|))) (.cse5 (= 13 |old(~a8~0)|)) (.cse17 (and .cse6 .cse7 .cse10)) (.cse16 (< 0 |old(~a17~0)|)) (.cse13 (= 1 ~a7~0)) (.cse14 (or (not (= 1 ~a20~0)) (not (= ~a20~0 ~a7~0)))) (.cse3 (not (= 1 |old(~a7~0)|))) (.cse12 (and (= |old(~a7~0)| |old(~a20~0)|) .cse30))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (< 0 |old(~a20~0)|) .cse4) (or .cse1 .cse2 .cse9 .cse11 .cse12 .cse4) (or (and .cse13 .cse7 .cse9 .cse10 .cse14) .cse3 .cse11 .cse12 .cse4) (or .cse1 .cse0 .cse15 .cse16) (or .cse1 (= |old(~a7~0)| 1) .cse2 .cse17) (or .cse18 (or (or .cse19 .cse20 .cse21 (not (= 5 |old(~a16~0)|)) .cse22) .cse16)) (or .cse1 .cse23 .cse3 .cse4 (and .cse13 .cse7 .cse24 .cse10 .cse18 .cse25)) (or .cse2 (and .cse13 .cse7 .cse8 .cse26 .cse10) (< |old(~a20~0)| 1) .cse3 .cse16) (or .cse5 .cse16 (and .cse8 .cse26) .cse12) (or (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= 3 ~c~0)) .cse27 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) (not (= |old(~a16~0)| 5)) (not (= |old(~a7~0)| 0)) (not (= |old(~a20~0)| 1)) (not (= |old(~a17~0)| 1)) (and .cse18 (= ~a16~0 5) (= ~a8~0 15) (= ~a7~0 0) .cse26 .cse28) (not (= |old(~a8~0)| 15))) (or .cse1 (and .cse10 .cse6 .cse7 (and .cse29 .cse18 .cse28)) .cse23 .cse15 .cse4) (or .cse1 (and .cse8 .cse10 .cse6 .cse7 .cse9) .cse5 .cse30 .cse11 .cse4) (or .cse18 (or .cse16 (or .cse19 .cse20 .cse31 .cse21 .cse32 .cse22 .cse27))) (or .cse2 .cse23 (and .cse6 .cse7 .cse24 .cse10 .cse18 .cse25) .cse4) (or .cse5 .cse17 .cse16 .cse12) (or (and .cse13 .cse7 .cse10 .cse14) .cse3 .cse12 (< |old(~a8~0)| 15)))))) [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:04:20,557 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:04:20,558 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:04:20,559 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:04:20,560 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,561 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:04:20,562 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= 1 ~a17~0) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:04:20,562 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:04:20,563 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:04:20,563 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= ~a16~0 5) (= ~a8~0 15) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:04:20,563 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:20,563 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse11 (= ~a12~0 8)) (.cse10 (= ~a21~0 1))) (let ((.cse0 (or (not (= 1 ~a20~0)) (not (= ~a20~0 ~a7~0)))) (.cse3 (<= ~a8~0 13)) (.cse4 (= 1 ~a7~0)) (.cse1 (<= ~a17~0 0)) (.cse9 (= ~a20~0 1)) (.cse2 (not (= ~a8~0 13))) (.cse8 (<= ~a8~0 14)) (.cse6 (not (= main_~input~0 0))) (.cse7 (and (not (= ~a16~0 0)) (not (= ~a8~0 0)) (= ~a17~0 1) .cse11 .cse10)) (.cse5 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (= 1 ~a17~0)) (and .cse3 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= 3 ~c~0)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 (<= 15 ~a8~0) .cse0) (and .cse4 .cse6 .cse7 .cse5) (and .cse5 .cse1 .cse8) (not (= 1 |old(~a21~0)|)) (and .cse3 .cse6 .cse7 .cse9) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse3 .cse7 .cse5) (and .cse4 .cse7 .cse0) (and (and .cse6 (and (= ~a8~0 15) .cse10)) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a16~0 5)) (not (= ~x~0 24)) (and .cse3 .cse4 .cse1 (<= 1 ~a20~0)) (not .cse11) (not (= ~e~0 5)) (and (not .cse9) .cse7 .cse5) (and .cse7 (<= ~a20~0 0) .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (and .cse8 (and .cse6 .cse7 .cse5)) (not (= 6 ~f~0))))) [2018-10-25 00:04:20,563 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:04:20,563 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:04:20,563 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:04:20,564 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse14 (= ~a12~0 8)) (.cse16 (not (= ~a16~0 0))) (.cse17 (not (= ~a8~0 0))) (.cse10 (= ~a21~0 1)) (.cse15 (= ~a20~0 1))) (let ((.cse8 (= ~a7~0 |old(~a7~0)|)) (.cse11 (<= ~a8~0 |old(~a8~0)|)) (.cse12 (<= ~a8~0 14)) (.cse4 (and .cse16 .cse17 .cse10 .cse15)) (.cse6 (= 1 ~a17~0)) (.cse0 (or (not (= 1 ~a20~0)) (not (= ~a20~0 ~a7~0)))) (.cse7 (<= ~a8~0 13)) (.cse3 (= 1 ~a7~0)) (.cse1 (<= ~a17~0 0)) (.cse5 (not (= ~a16~0 6))) (.cse13 (and .cse16 .cse17 .cse9 .cse14 .cse10)) (.cse2 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and (and (or (and (= (+ main_~output~0 1) 0) .cse9 .cse10) (and .cse10 .cse6 (not (= main_~input~0 0)))) .cse11 .cse8) (= ~a16~0 5)) (not (= 3 ~c~0)) (and .cse11 .cse3 (<= 15 ~a8~0) .cse0) (and .cse5 .cse1 .cse12) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (and (and .cse4 .cse5 .cse6) .cse12) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse7 .cse4 .cse6) (and .cse3 .cse13 .cse0) (not (= ~x~0 24)) (and .cse7 .cse3 .cse1 (<= 1 ~a20~0)) (not .cse14) (not (= ~e~0 5)) (and (not .cse15) .cse13 .cse5) (and .cse13 (<= ~a20~0 0) .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-10-25 00:04:20,564 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:04:20,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:04:20 BoogieIcfgContainer [2018-10-25 00:04:20,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:04:20,585 INFO L168 Benchmark]: Toolchain (without parser) took 139808.99 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:20,586 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:20,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:20,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 201.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:20,589 INFO L168 Benchmark]: Boogie Preprocessor took 103.60 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:04:20,589 INFO L168 Benchmark]: RCFGBuilder took 3161.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:04:20,590 INFO L168 Benchmark]: TraceAbstraction took 135634.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:04:20,595 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.53 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 201.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -818.7 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.60 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3161.42 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.6 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135634.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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 == a20) || !(a20 == a7)) && a17 <= 0) && !(a8 == 13)) || (((1 == a7 && ((!(a16 == 0) && !(a8 == 0)) && a21 == 1) && a20 == 1) && !(a16 == 6)) && 1 == a17)) || (((a8 <= 13 && 1 == a7) && !(a16 == 6)) && 1 == a17)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || ((((((output + 1 == 0 && a17 == 1) && a21 == 1) || ((a21 == 1 && 1 == a17) && !(input == 0))) && a8 <= \old(a8)) && a7 == \old(a7)) && a16 == 5)) || !(3 == c)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && (!(1 == a20) || !(a20 == a7)))) || ((!(a16 == 6) && a17 <= 0) && a8 <= 14)) || !(1 == \old(a21))) || !(4 == d)) || ((((((!(a16 == 0) && !(a8 == 0)) && a21 == 1) && a20 == 1) && !(a16 == 6)) && 1 == a17) && a8 <= 14)) || !(2 == b)) || !(y == 25)) || ((a8 <= 13 && ((!(a16 == 0) && !(a8 == 0)) && a21 == 1) && a20 == 1) && 1 == a17)) || ((1 == a7 && (((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && (!(1 == a20) || !(a20 == a7)))) || !(x == 24)) || (((a8 <= 13 && 1 == a7) && a17 <= 0) && 1 <= a20)) || !(a12 == 8)) || !(e == 5)) || ((!(a20 == 1) && (((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && !(a16 == 6))) || ((((((!(a16 == 0) && !(a8 == 0)) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0) && !(a8 == 13))) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 135.5s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 86.3s AutomataDifference, 0.0s DeadEndRemovalTime, 14.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1746 SDtfs, 14639 SDslu, 2163 SDs, 0 SdLazy, 22403 SolverSat, 2789 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2501 GetRequests, 1855 SyntacticMatches, 446 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3672 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12993occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9970111577397227 AbsIntWeakeningRatio, 0.2403598971722365 AbsIntAvgWeakeningVarsNumRemoved, 0.8688946015424165 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1929 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 620 PreInvPairs, 974 NumberOfFragments, 1683 HoareAnnotationTreeSize, 620 FomulaSimplifications, 59177 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 43603 FormulaSimplificationTreeSizeReductionInter, 10.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2728 NumberOfCodeBlocks, 2728 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3466 ConstructedInterpolants, 0 QuantifiedInterpolants, 1773441 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2203 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 2161/2447 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...