java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:05:52,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:05:52,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:05:52,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:05:52,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:05:52,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:05:52,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:05:52,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:05:52,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:05:52,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:05:52,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:05:52,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:05:52,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:05:52,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:05:52,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:05:52,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:05:52,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:05:52,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:05:52,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:05:52,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:05:52,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:05:52,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:05:52,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:05:52,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:05:52,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:05:52,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:05:52,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:05:52,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:05:52,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:05:52,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:05:52,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:05:52,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:05:52,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:05:52,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:05:52,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:05:52,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:05:52,961 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:05:52,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:05:52,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:05:52,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:05:52,984 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:05:52,984 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:05:52,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:05:52,984 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:05:52,988 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:05:52,988 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:05:52,988 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:05:52,988 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:05:52,988 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:05:52,989 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:05:52,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:05:52,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:05:52,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:05:52,991 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:05:52,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:05:52,991 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:05:52,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:05:52,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:05:52,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:05:52,992 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:05:52,992 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:05:52,992 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:05:52,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:05:52,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:05:52,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:05:52,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:05:52,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:05:52,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:05:52,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:05:52,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:05:52,995 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:05:52,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:05:53,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:05:53,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:05:53,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:05:53,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:05:53,080 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:05:53,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label04_true-unreach-call.c [2018-11-07 20:05:53,146 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d913f7b/371d4d8751b44c82a2917b1618801a02/FLAG2a1a09aad [2018-11-07 20:05:53,797 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:05:53,798 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label04_true-unreach-call.c [2018-11-07 20:05:53,814 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d913f7b/371d4d8751b44c82a2917b1618801a02/FLAG2a1a09aad [2018-11-07 20:05:53,830 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5d913f7b/371d4d8751b44c82a2917b1618801a02 [2018-11-07 20:05:53,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:05:53,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:05:53,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:05:53,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:05:53,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:05:53,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:05:53" (1/1) ... [2018-11-07 20:05:53,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ddd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:53, skipping insertion in model container [2018-11-07 20:05:53,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:05:53" (1/1) ... [2018-11-07 20:05:53,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:05:53,934 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:05:54,550 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:05:54,554 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:05:54,752 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:05:54,773 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:05:54,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54 WrapperNode [2018-11-07 20:05:54,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:05:54,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:05:54,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:05:54,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:05:54,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:54,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:54,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:05:54,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:05:54,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:05:54,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:05:54,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:54,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:54,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:54,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:55,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:55,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:55,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... [2018-11-07 20:05:55,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:05:55,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:05:55,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:05:55,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:05:55,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:05:55,155 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:05:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:05:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:05:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:05:55,157 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:05:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:05:55,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:05:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:05:55,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:05:59,647 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:05:59,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:05:59 BoogieIcfgContainer [2018-11-07 20:05:59,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:05:59,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:05:59,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:05:59,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:05:59,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:05:53" (1/3) ... [2018-11-07 20:05:59,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519fc1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:05:59, skipping insertion in model container [2018-11-07 20:05:59,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:05:54" (2/3) ... [2018-11-07 20:05:59,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519fc1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:05:59, skipping insertion in model container [2018-11-07 20:05:59,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:05:59" (3/3) ... [2018-11-07 20:05:59,657 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label04_true-unreach-call.c [2018-11-07 20:05:59,668 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:05:59,677 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:05:59,692 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:05:59,731 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:05:59,732 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:05:59,732 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:05:59,732 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:05:59,732 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:05:59,732 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:05:59,733 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:05:59,733 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:05:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-07 20:05:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-07 20:05:59,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:05:59,774 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] [2018-11-07 20:05:59,776 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:05:59,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:05:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash 244570780, now seen corresponding path program 1 times [2018-11-07 20:05:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:05:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:59,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:05:59,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:05:59,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:05:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:06:00,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:06:00,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:06:00,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:00,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:06:00,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:06:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:00,359 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-11-07 20:06:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:03,820 INFO L93 Difference]: Finished difference Result 985 states and 1761 transitions. [2018-11-07 20:06:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:06:03,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-07 20:06:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:03,847 INFO L225 Difference]: With dead ends: 985 [2018-11-07 20:06:03,847 INFO L226 Difference]: Without dead ends: 686 [2018-11-07 20:06:03,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-07 20:06:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2018-11-07 20:06:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-07 20:06:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1046 transitions. [2018-11-07 20:06:03,967 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1046 transitions. Word has length 60 [2018-11-07 20:06:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:03,968 INFO L480 AbstractCegarLoop]: Abstraction has 686 states and 1046 transitions. [2018-11-07 20:06:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:06:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1046 transitions. [2018-11-07 20:06:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 20:06:03,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:03,979 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:06:03,979 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:03,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 332575963, now seen corresponding path program 1 times [2018-11-07 20:06:03,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:03,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:03,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:03,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:06:04,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:06:04,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:06:04,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:04,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:06:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:06:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:06:04,324 INFO L87 Difference]: Start difference. First operand 686 states and 1046 transitions. Second operand 6 states. [2018-11-07 20:06:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:09,451 INFO L93 Difference]: Finished difference Result 2339 states and 3736 transitions. [2018-11-07 20:06:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:06:09,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-07 20:06:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:09,466 INFO L225 Difference]: With dead ends: 2339 [2018-11-07 20:06:09,466 INFO L226 Difference]: Without dead ends: 1659 [2018-11-07 20:06:09,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:06:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-11-07 20:06:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1642. [2018-11-07 20:06:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2018-11-07 20:06:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2356 transitions. [2018-11-07 20:06:09,564 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2356 transitions. Word has length 141 [2018-11-07 20:06:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:09,565 INFO L480 AbstractCegarLoop]: Abstraction has 1642 states and 2356 transitions. [2018-11-07 20:06:09,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:06:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2356 transitions. [2018-11-07 20:06:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-07 20:06:09,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:09,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:06:09,578 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:09,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 864779959, now seen corresponding path program 1 times [2018-11-07 20:06:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:09,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:09,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:06:10,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:06:10,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:06:10,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-07 20:06:10,323 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:06:10,374 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:06:10,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:06:11,088 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:06:12,323 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:06:12,324 INFO L272 AbstractInterpreter]: Visited 139 different actions 404 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:06:12,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:12,370 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:06:13,265 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 73.84% of their original sizes. [2018-11-07 20:06:13,265 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:06:14,638 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-07 20:06:14,640 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:06:14,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:06:14,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-11-07 20:06:14,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:14,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 20:06:14,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 20:06:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 20:06:14,644 INFO L87 Difference]: Start difference. First operand 1642 states and 2356 transitions. Second operand 13 states. [2018-11-07 20:06:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:49,607 INFO L93 Difference]: Finished difference Result 3863 states and 5540 transitions. [2018-11-07 20:06:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:06:49,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 192 [2018-11-07 20:06:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:49,621 INFO L225 Difference]: With dead ends: 3863 [2018-11-07 20:06:49,621 INFO L226 Difference]: Without dead ends: 2227 [2018-11-07 20:06:49,627 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:06:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-11-07 20:06:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2221. [2018-11-07 20:06:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2018-11-07 20:06:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 2967 transitions. [2018-11-07 20:06:49,684 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 2967 transitions. Word has length 192 [2018-11-07 20:06:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:49,685 INFO L480 AbstractCegarLoop]: Abstraction has 2221 states and 2967 transitions. [2018-11-07 20:06:49,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 20:06:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2967 transitions. [2018-11-07 20:06:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-07 20:06:49,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:49,691 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:06:49,691 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:49,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash 233507026, now seen corresponding path program 1 times [2018-11-07 20:06:49,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:49,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:49,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:49,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:49,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 20:06:50,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:06:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:06:50,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:50,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:06:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:06:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:50,033 INFO L87 Difference]: Start difference. First operand 2221 states and 2967 transitions. Second operand 4 states. [2018-11-07 20:06:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:51,991 INFO L93 Difference]: Finished difference Result 7043 states and 10169 transitions. [2018-11-07 20:06:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:06:51,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-11-07 20:06:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:52,023 INFO L225 Difference]: With dead ends: 7043 [2018-11-07 20:06:52,024 INFO L226 Difference]: Without dead ends: 5021 [2018-11-07 20:06:52,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2018-11-07 20:06:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 4999. [2018-11-07 20:06:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2018-11-07 20:06:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 6767 transitions. [2018-11-07 20:06:52,196 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 6767 transitions. Word has length 258 [2018-11-07 20:06:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:52,202 INFO L480 AbstractCegarLoop]: Abstraction has 4999 states and 6767 transitions. [2018-11-07 20:06:52,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:06:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 6767 transitions. [2018-11-07 20:06:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-07 20:06:52,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:52,219 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:06:52,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:52,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 662498493, now seen corresponding path program 1 times [2018-11-07 20:06:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:52,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:52,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:52,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 20:06:52,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:06:52,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:06:52,654 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:52,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:06:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:06:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:52,656 INFO L87 Difference]: Start difference. First operand 4999 states and 6767 transitions. Second operand 4 states. [2018-11-07 20:06:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:06:54,708 INFO L93 Difference]: Finished difference Result 14166 states and 20694 transitions. [2018-11-07 20:06:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:06:54,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-11-07 20:06:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:06:54,764 INFO L225 Difference]: With dead ends: 14166 [2018-11-07 20:06:54,764 INFO L226 Difference]: Without dead ends: 9747 [2018-11-07 20:06:54,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:06:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2018-11-07 20:06:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 8369. [2018-11-07 20:06:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2018-11-07 20:06:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 11173 transitions. [2018-11-07 20:06:55,663 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 11173 transitions. Word has length 322 [2018-11-07 20:06:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:06:55,663 INFO L480 AbstractCegarLoop]: Abstraction has 8369 states and 11173 transitions. [2018-11-07 20:06:55,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:06:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 11173 transitions. [2018-11-07 20:06:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-07 20:06:55,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:06:55,723 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:06:55,723 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:06:55,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1642265406, now seen corresponding path program 1 times [2018-11-07 20:06:55,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:06:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:55,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:06:55,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:06:55,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:06:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:06:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 353 proven. 78 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 20:06:56,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:06:56,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:06:56,327 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 419 with the following transitions: [2018-11-07 20:06:56,327 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:06:56,334 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:06:56,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:06:56,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:06:57,171 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:06:57,171 INFO L272 AbstractInterpreter]: Visited 167 different actions 661 times. Merged at 7 different actions 26 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:06:57,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:06:57,177 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:06:57,815 INFO L227 lantSequenceWeakener]: Weakened 413 states. On average, predicates are now at 73.43% of their original sizes. [2018-11-07 20:06:57,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:06:57,964 INFO L415 sIntCurrentIteration]: We unified 417 AI predicates to 417 [2018-11-07 20:06:57,965 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:06:57,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:06:57,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 20:06:57,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:06:57,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:06:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:06:57,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:06:57,967 INFO L87 Difference]: Start difference. First operand 8369 states and 11173 transitions. Second operand 10 states. [2018-11-07 20:07:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:11,991 INFO L93 Difference]: Finished difference Result 17241 states and 23183 transitions. [2018-11-07 20:07:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 20:07:11,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 418 [2018-11-07 20:07:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:12,040 INFO L225 Difference]: With dead ends: 17241 [2018-11-07 20:07:12,040 INFO L226 Difference]: Without dead ends: 9452 [2018-11-07 20:07:12,071 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 424 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:07:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2018-11-07 20:07:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9432. [2018-11-07 20:07:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9432 states. [2018-11-07 20:07:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9432 states to 9432 states and 12360 transitions. [2018-11-07 20:07:12,314 INFO L78 Accepts]: Start accepts. Automaton has 9432 states and 12360 transitions. Word has length 418 [2018-11-07 20:07:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:12,315 INFO L480 AbstractCegarLoop]: Abstraction has 9432 states and 12360 transitions. [2018-11-07 20:07:12,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:07:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9432 states and 12360 transitions. [2018-11-07 20:07:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-07 20:07:12,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:12,373 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:07:12,373 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:12,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1438403122, now seen corresponding path program 1 times [2018-11-07 20:07:12,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:12,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:12,944 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 20:07:13,139 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 20:07:13,554 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 20:07:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 251 proven. 88 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-07 20:07:13,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:13,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:13,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 427 with the following transitions: [2018-11-07 20:07:13,893 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:13,898 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:13,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:13,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:07:15,309 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:07:15,309 INFO L272 AbstractInterpreter]: Visited 168 different actions 663 times. Merged at 7 different actions 26 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:07:15,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:15,315 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:07:15,907 INFO L227 lantSequenceWeakener]: Weakened 422 states. On average, predicates are now at 73.45% of their original sizes. [2018-11-07 20:07:15,908 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:07:16,019 INFO L415 sIntCurrentIteration]: We unified 425 AI predicates to 425 [2018-11-07 20:07:16,020 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:07:16,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:07:16,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-11-07 20:07:16,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:16,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:07:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:07:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:07:16,021 INFO L87 Difference]: Start difference. First operand 9432 states and 12360 transitions. Second operand 11 states. [2018-11-07 20:07:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:35,045 INFO L93 Difference]: Finished difference Result 17587 states and 23486 transitions. [2018-11-07 20:07:35,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 20:07:35,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 426 [2018-11-07 20:07:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:35,087 INFO L225 Difference]: With dead ends: 17587 [2018-11-07 20:07:35,087 INFO L226 Difference]: Without dead ends: 9798 [2018-11-07 20:07:35,115 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 438 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2018-11-07 20:07:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9798 states. [2018-11-07 20:07:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9798 to 9625. [2018-11-07 20:07:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9625 states. [2018-11-07 20:07:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9625 states to 9625 states and 12568 transitions. [2018-11-07 20:07:35,305 INFO L78 Accepts]: Start accepts. Automaton has 9625 states and 12568 transitions. Word has length 426 [2018-11-07 20:07:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:35,306 INFO L480 AbstractCegarLoop]: Abstraction has 9625 states and 12568 transitions. [2018-11-07 20:07:35,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:07:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 9625 states and 12568 transitions. [2018-11-07 20:07:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-11-07 20:07:35,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:35,355 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:07:35,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:35,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1385667270, now seen corresponding path program 1 times [2018-11-07 20:07:35,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:35,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:07:36,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:36,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:36,108 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2018-11-07 20:07:36,108 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:36,111 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:36,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:36,176 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:07:36,572 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:07:36,572 INFO L272 AbstractInterpreter]: Visited 167 different actions 488 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:07:36,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:36,580 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:07:37,143 INFO L227 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 73.57% of their original sizes. [2018-11-07 20:07:37,144 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:07:37,521 INFO L415 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2018-11-07 20:07:37,521 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:07:37,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:07:37,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-07 20:07:37,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:37,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:07:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:07:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:07:37,523 INFO L87 Difference]: Start difference. First operand 9625 states and 12568 transitions. Second operand 20 states. [2018-11-07 20:07:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:57,866 INFO L93 Difference]: Finished difference Result 17803 states and 23597 transitions. [2018-11-07 20:07:57,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:07:57,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 442 [2018-11-07 20:07:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:57,905 INFO L225 Difference]: With dead ends: 17803 [2018-11-07 20:07:57,905 INFO L226 Difference]: Without dead ends: 10014 [2018-11-07 20:07:57,927 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 454 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 20:07:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10014 states. [2018-11-07 20:07:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10014 to 10007. [2018-11-07 20:07:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10007 states. [2018-11-07 20:07:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10007 states to 10007 states and 12981 transitions. [2018-11-07 20:07:58,123 INFO L78 Accepts]: Start accepts. Automaton has 10007 states and 12981 transitions. Word has length 442 [2018-11-07 20:07:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:58,124 INFO L480 AbstractCegarLoop]: Abstraction has 10007 states and 12981 transitions. [2018-11-07 20:07:58,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:07:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10007 states and 12981 transitions. [2018-11-07 20:07:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-11-07 20:07:58,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:58,159 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:58,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:58,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1907770169, now seen corresponding path program 1 times [2018-11-07 20:07:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:58,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 382 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:07:58,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:58,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:58,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 445 with the following transitions: [2018-11-07 20:07:58,892 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [582], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:58,895 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:58,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:59,056 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:08:00,810 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:08:00,810 INFO L272 AbstractInterpreter]: Visited 170 different actions 1001 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-07 20:08:00,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:00,819 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:08:01,370 INFO L227 lantSequenceWeakener]: Weakened 440 states. On average, predicates are now at 73.48% of their original sizes. [2018-11-07 20:08:01,371 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:08:01,596 INFO L415 sIntCurrentIteration]: We unified 443 AI predicates to 443 [2018-11-07 20:08:01,596 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:08:01,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:08:01,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 20:08:01,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:08:01,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 20:08:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 20:08:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 20:08:01,598 INFO L87 Difference]: Start difference. First operand 10007 states and 12981 transitions. Second operand 14 states. [2018-11-07 20:08:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:08:29,812 INFO L93 Difference]: Finished difference Result 20601 states and 27625 transitions. [2018-11-07 20:08:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:08:29,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 444 [2018-11-07 20:08:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:08:29,853 INFO L225 Difference]: With dead ends: 20601 [2018-11-07 20:08:29,853 INFO L226 Difference]: Without dead ends: 12623 [2018-11-07 20:08:29,878 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 463 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 20:08:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2018-11-07 20:08:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 12409. [2018-11-07 20:08:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12409 states. [2018-11-07 20:08:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12409 states to 12409 states and 16026 transitions. [2018-11-07 20:08:30,106 INFO L78 Accepts]: Start accepts. Automaton has 12409 states and 16026 transitions. Word has length 444 [2018-11-07 20:08:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:08:30,107 INFO L480 AbstractCegarLoop]: Abstraction has 12409 states and 16026 transitions. [2018-11-07 20:08:30,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 20:08:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12409 states and 16026 transitions. [2018-11-07 20:08:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-07 20:08:30,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:08:30,142 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:08:30,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:08:30,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash -320646423, now seen corresponding path program 1 times [2018-11-07 20:08:30,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:08:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:30,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:08:30,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:30,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:08:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:08:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 403 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:08:30,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:08:30,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:08:30,921 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 464 with the following transitions: [2018-11-07 20:08:30,921 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:08:30,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:08:30,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:08:30,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:08:31,935 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:08:31,936 INFO L272 AbstractInterpreter]: Visited 167 different actions 488 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:08:31,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:31,972 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:08:33,807 INFO L227 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 74.13% of their original sizes. [2018-11-07 20:08:33,807 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:08:34,312 INFO L415 sIntCurrentIteration]: We unified 462 AI predicates to 462 [2018-11-07 20:08:34,313 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:08:34,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:08:34,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 20:08:34,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:08:34,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 20:08:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 20:08:34,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-11-07 20:08:34,315 INFO L87 Difference]: Start difference. First operand 12409 states and 16026 transitions. Second operand 23 states. [2018-11-07 20:09:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:09:01,925 INFO L93 Difference]: Finished difference Result 21546 states and 28104 transitions. [2018-11-07 20:09:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 20:09:01,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 463 [2018-11-07 20:09:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:09:01,960 INFO L225 Difference]: With dead ends: 21546 [2018-11-07 20:09:01,960 INFO L226 Difference]: Without dead ends: 13377 [2018-11-07 20:09:01,980 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 483 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 20:09:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13377 states. [2018-11-07 20:09:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13377 to 13368. [2018-11-07 20:09:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13368 states. [2018-11-07 20:09:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13368 states to 13368 states and 17045 transitions. [2018-11-07 20:09:02,236 INFO L78 Accepts]: Start accepts. Automaton has 13368 states and 17045 transitions. Word has length 463 [2018-11-07 20:09:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:09:02,236 INFO L480 AbstractCegarLoop]: Abstraction has 13368 states and 17045 transitions. [2018-11-07 20:09:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 20:09:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13368 states and 17045 transitions. [2018-11-07 20:09:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-11-07 20:09:02,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:09:02,270 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:09:02,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:09:02,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash -189650738, now seen corresponding path program 1 times [2018-11-07 20:09:02,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:09:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:09:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:02,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:09:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:09:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 389 proven. 139 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 20:09:03,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:09:03,218 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:09:03,219 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 480 with the following transitions: [2018-11-07 20:09:03,219 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [831], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [916], [921], [923], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:09:03,223 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:09:03,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:09:03,337 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:09:05,594 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:09:05,595 INFO L272 AbstractInterpreter]: Visited 167 different actions 1315 times. Merged at 7 different actions 56 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:09:05,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:05,605 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:09:06,749 INFO L227 lantSequenceWeakener]: Weakened 474 states. On average, predicates are now at 75.33% of their original sizes. [2018-11-07 20:09:06,749 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:09:07,315 INFO L415 sIntCurrentIteration]: We unified 478 AI predicates to 478 [2018-11-07 20:09:07,315 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:09:07,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:09:07,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 20:09:07,316 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:09:07,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:09:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:09:07,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:09:07,317 INFO L87 Difference]: Start difference. First operand 13368 states and 17045 transitions. Second operand 10 states. [2018-11-07 20:09:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:09:16,701 INFO L93 Difference]: Finished difference Result 26329 states and 34790 transitions. [2018-11-07 20:09:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:09:16,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 479 [2018-11-07 20:09:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:09:16,740 INFO L225 Difference]: With dead ends: 26329 [2018-11-07 20:09:16,741 INFO L226 Difference]: Without dead ends: 15434 [2018-11-07 20:09:16,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 486 GetRequests, 422 SyntacticMatches, 48 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:09:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states. [2018-11-07 20:09:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15434 to 15204. [2018-11-07 20:09:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15204 states. [2018-11-07 20:09:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 19175 transitions. [2018-11-07 20:09:17,027 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 19175 transitions. Word has length 479 [2018-11-07 20:09:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:09:17,028 INFO L480 AbstractCegarLoop]: Abstraction has 15204 states and 19175 transitions. [2018-11-07 20:09:17,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:09:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 19175 transitions. [2018-11-07 20:09:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-11-07 20:09:17,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:09:17,064 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:09:17,065 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:09:17,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 119199118, now seen corresponding path program 1 times [2018-11-07 20:09:17,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:09:17,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:09:17,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:17,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:09:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:09:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-11-07 20:09:17,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:09:17,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:09:17,464 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:09:17,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:09:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:09:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:09:17,465 INFO L87 Difference]: Start difference. First operand 15204 states and 19175 transitions. Second operand 4 states. [2018-11-07 20:09:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:09:18,405 INFO L93 Difference]: Finished difference Result 26073 states and 33426 transitions. [2018-11-07 20:09:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:09:18,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 491 [2018-11-07 20:09:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:09:18,406 INFO L225 Difference]: With dead ends: 26073 [2018-11-07 20:09:18,406 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:09:18,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:09:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:09:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:09:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:09:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:09:18,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 491 [2018-11-07 20:09:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:09:18,442 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:09:18,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:09:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:09:18,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:09:18,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:09:19,092 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-07 20:09:19,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:09:19,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:09:19,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:09:19,399 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 31 [2018-11-07 20:09:20,064 WARN L179 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-11-07 20:09:20,700 WARN L179 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-11-07 20:09:25,735 WARN L179 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 442 DAG size of output: 256 [2018-11-07 20:09:25,844 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2018-11-07 20:09:25,959 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2018-11-07 20:09:25,962 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a29~0 |old(~a29~0)|) [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,963 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-07 20:09:25,964 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,965 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,966 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-07 20:09:25,967 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,968 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,969 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,970 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,971 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-07 20:09:25,972 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-07 20:09:25,973 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,974 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,975 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,975 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,976 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse20 (+ |old(~a23~0)| 43))) (let ((.cse22 (< |old(~a29~0)| 130)) (.cse39 (< 312 |old(~a23~0)|)) (.cse31 (< |old(~a25~0)| 10)) (.cse41 (< |old(~a4~0)| 0)) (.cse42 (< 1 |old(~a4~0)|)) (.cse0 (not (= 15 ~a8~0))) (.cse5 (not (= 1 ~a3~0))) (.cse37 (< 0 .cse20)) (.cse15 (< |old(~a29~0)| 260)) (.cse17 (< (+ |old(~a23~0)| 599777) 0)) (.cse24 (< |old(~a23~0)| 312)) (.cse38 (<= |old(~a29~0)| 245)) (.cse19 (+ ~a23~0 43))) (let ((.cse4 (< 369435 |old(~a29~0)|)) (.cse10 (<= ~a25~0 10)) (.cse3 (= 9 |old(~a25~0)|)) (.cse21 (< 130 |old(~a29~0)|)) (.cse12 (<= 0 (+ ~a23~0 599777))) (.cse26 (= (mod ~a23~0 12) 0)) (.cse27 (<= 0 (+ ~a23~0 2147483648))) (.cse16 (not (= 0 (mod |old(~a23~0)| 12)))) (.cse32 (= (mod ~a25~0 2) 0)) (.cse34 (<= ~a4~0 1)) (.cse35 (<= 0 ~a4~0)) (.cse33 (<= 10 ~a25~0)) (.cse36 (<= ~a25~0 12)) (.cse25 (<= .cse19 0)) (.cse11 (or .cse24 .cse38)) (.cse14 (not (= 12 |old(~a25~0)|))) (.cse13 (= ~a25~0 12)) (.cse40 (< 275 |old(~a29~0)|)) (.cse28 (and (or (< 215160 |old(~a29~0)|) .cse31 .cse41 .cse42 .cse22 (< (+ |old(~a23~0)| 2147483648) 0) .cse39 .cse0 .cse5) (or .cse31 .cse41 .cse42 .cse0 .cse5 .cse37 .cse15 .cse17))) (.cse6 (not (= 312 |old(~a23~0)|))) (.cse29 (not (= 0 (mod |old(~a25~0)| 2)))) (.cse30 (< 12 |old(~a25~0)|)) (.cse2 (< 6 |calculate_output_#in~input|)) (.cse23 (<= ~a23~0 312)) (.cse9 (= ~a4~0 1)) (.cse7 (not (= 1 |old(~a4~0)|))) (.cse1 (not (= 13 |old(~a25~0)|))) (.cse43 (< 220 |old(~a29~0)|)) (.cse8 (< |calculate_output_#in~input| 1)) (.cse18 (= ~a29~0 |old(~a29~0)|))) (and (or .cse0 (= 13 ~a25~0) .cse1) (or .cse2 (= ~a25~0 9) (or (not .cse3) (< |old(~a29~0)| 369425) .cse4) .cse0 .cse5 .cse6 .cse7 .cse8) (or .cse2 (< |old(~a25~0)| 9) .cse4 .cse0 .cse5 (and (<= 9 ~a25~0) .cse9 (= ~a23~0 312) .cse10) .cse6 .cse7 .cse11 .cse8 (< 10 |old(~a25~0)|)) (or (and (<= (+ ~a23~0 599772) 0) .cse12 (= ~a4~0 0) .cse13) (or .cse2 (< 274 |old(~a29~0)|) (< 0 (+ |old(~a23~0)| 599772)) .cse14 .cse0 .cse5 .cse15 .cse16 .cse17 (not (= 0 |old(~a4~0)|)) .cse8)) (or .cse0 (and .cse18 (< 0 .cse19)) (<= .cse20 0)) (or (not (= |old(~a25~0)| 10)) .cse21 (not (= ~inputF~0 6)) .cse22 (not (= 1 ~inputA~0)) (not (= 4 ~inputD~0)) .cse8 .cse2 (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= ~a3~0 1)) .cse7 (and .cse23 .cse10) (not (= ~a8~0 15))) (or .cse0 .cse24 (<= 312 ~a23~0)) (or .cse0 (and .cse18 (not (= 9 ~a25~0))) .cse3) (or .cse0 .cse21 .cse18) (or (and .cse23 (or (<= ~a29~0 215160) (and .cse12 .cse25)) .cse26 .cse27) .cse2 .cse28 (< 299861 |old(~a29~0)|) (< |old(~a29~0)| 278) .cse7 .cse16 .cse29 .cse30 .cse8) (or .cse2 .cse31 (and (<= ~a25~0 13) .cse32 .cse9 .cse33) (< 2147483647 |old(~a29~0)|) (< 13 |old(~a25~0)|) .cse0 .cse5 .cse7 .cse29 (< |old(~a29~0)| 52) .cse8) (or .cse2 (and .cse32 .cse34 .cse35 .cse33 .cse26 .cse36 .cse27 .cse25) (< 277 |old(~a29~0)|) .cse28 .cse37 .cse16 .cse29 .cse30 .cse8 .cse38) (or .cse23 .cse11 .cse8 .cse2 .cse31 .cse39 .cse0 .cse5 .cse7 .cse40 .cse29 .cse30) (or .cse2 .cse31 .cse41 .cse42 (< 261 |old(~a29~0)|) .cse0 .cse5 (< (+ |old(~a23~0)| 599899) 0) .cse37 (and (<= 0 (+ ~a23~0 599899)) .cse32 .cse34 .cse35 (= (mod ~a23~0 2) 0) .cse33 .cse36 .cse25) (not (= 0 (mod |old(~a23~0)| 2))) .cse29 .cse30 .cse8 .cse38) (or .cse11 .cse8 .cse2 (or (< |old(~a29~0)| 261) .cse14) .cse13 .cse39 .cse5 .cse0 .cse7 .cse40) (or .cse23 .cse28 .cse6 .cse8 .cse2 .cse7 .cse43 .cse29 .cse30) (or .cse2 (not (= 0 (mod |old(~a23~0)| 4))) (and .cse23 .cse9 (= (mod ~a23~0 4) 0) (<= 0 (+ ~a23~0 252))) .cse39 .cse0 .cse5 .cse7 .cse1 (< |old(~a29~0)| 117) (< (+ |old(~a23~0)| 252) 0) .cse43 .cse8) (or .cse18 .cse0 .cse38))))) [2018-11-07 20:09:25,976 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,976 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-07 20:09:25,976 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-07 20:09:25,976 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-07 20:09:25,977 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,978 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,979 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-07 20:09:25,980 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-07 20:09:25,981 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,982 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,983 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,984 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-07 20:09:25,985 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,986 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-07 20:09:25,987 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,988 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,989 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,990 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-07 20:09:25,991 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,992 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,993 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:09:25,994 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:09:25,995 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~a23~0 312) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a8~0 15) (= ~a29~0 130) (= ~inputB~0 2) (= ~a4~0 1) (= ~inputE~0 5) (= ~inputD~0 4) (= ~a25~0 10) (= ~a3~0 1)) [2018-11-07 20:09:25,995 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:09:25,995 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:09:25,995 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (and (= ~a4~0 1) (= ~a25~0 10) (= ~a23~0 312) (= ~a29~0 130)) (not (= 130 |old(~a29~0)|)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= |old(~a25~0)| 10)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)) (not (= ~inputF~0 6))) [2018-11-07 20:09:25,995 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-11-07 20:09:25,995 INFO L421 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (or (<= ~a29~0 130) (< 245 ~a29~0) (not (= 130 |old(~a29~0)|)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (< 0 (+ ~a23~0 43)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= |old(~a25~0)| 10)) (not (= 9 ~a25~0)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)) (not (= ~inputF~0 6))) [2018-11-07 20:09:25,995 INFO L425 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-11-07 20:09:25,996 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-07 20:09:25,996 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-07 20:09:25,996 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (or (<= ~a29~0 130) (< 245 ~a29~0) (not (= 130 |old(~a29~0)|)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (< 0 (+ ~a23~0 43)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= |old(~a23~0)| 312)) (not (= 2 ~inputB~0)) (not (= |old(~a25~0)| 10)) (not (= 9 ~a25~0)) (not (= ~a3~0 1)) (not (= 1 |old(~a4~0)|)) (not (= ~a8~0 15)) (not (= ~inputF~0 6))) [2018-11-07 20:09:25,996 INFO L425 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-11-07 20:09:26,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:09:26 BoogieIcfgContainer [2018-11-07 20:09:26,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:09:26,009 INFO L168 Benchmark]: Toolchain (without parser) took 212166.84 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.7 MB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-11-07 20:09:26,010 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:09:26,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.86 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:09:26,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:09:26,012 INFO L168 Benchmark]: Boogie Preprocessor took 129.40 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-11-07 20:09:26,013 INFO L168 Benchmark]: RCFGBuilder took 4571.60 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: 169.4 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:09:26,014 INFO L168 Benchmark]: TraceAbstraction took 206358.37 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 332.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. [2018-11-07 20:09:26,018 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.27 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 929.86 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 171.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.40 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 4571.60 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: 169.4 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206358.37 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 332.7 MB). Peak memory consumption was 3.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 165]: 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: 1034]: Loop Invariant Derived loop invariant: ((((((((((((((a29 <= 130 || 245 < a29) || !(130 == \old(a29))) || !(4 == inputD)) || !(inputE == 5)) || 0 < a23 + 43) || !(inputA == 1)) || !(3 == inputC)) || !(\old(a23) == 312)) || !(2 == inputB)) || !(\old(a25) == 10)) || !(9 == a25)) || !(a3 == 1)) || !(1 == \old(a4))) || !(a8 == 15)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 206.2s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 167.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3083 SDtfs, 12029 SDslu, 5031 SDs, 0 SdLazy, 29420 SolverSat, 2305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.6s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2977 GetRequests, 2737 SyntacticMatches, 48 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15204occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.1s AbstIntTime, 7 AbstIntIterations, 7 AbstIntStrong, 0.9980682339889346 AbsIntWeakeningRatio, 0.0840042002100105 AbsIntAvgWeakeningVarsNumRemoved, 23.309415470773537 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2076 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 340 PreInvPairs, 466 NumberOfFragments, 1283 HoareAnnotationTreeSize, 340 FomulaSimplifications, 22407 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6973 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 4136 NumberOfCodeBlocks, 4136 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 4124 ConstructedInterpolants, 0 QuantifiedInterpolants, 5274856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 3630/3947 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...