java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:24:37,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:24:37,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:24:37,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:24:37,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:24:37,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:24:37,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:24:37,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:24:37,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:24:37,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:24:37,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:24:37,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:24:37,933 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:24:37,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:24:37,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:24:37,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:24:37,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:24:37,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:24:37,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:24:37,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:24:37,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:24:37,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:24:37,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:24:37,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:24:37,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:24:37,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:24:37,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:24:37,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:24:37,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:24:37,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:24:37,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:24:37,956 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:24:37,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:24:37,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:24:37,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:24:37,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:24:37,962 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:24:37,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:24:37,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:24:37,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:24:37,980 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:24:37,980 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:24:37,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:24:37,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:24:37,981 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:24:37,981 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:24:37,981 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:24:37,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:24:37,981 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:24:37,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:24:37,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:24:37,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:24:37,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:24:37,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:24:37,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:24:37,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:24:37,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:24:37,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:24:37,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:24:37,984 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:24:37,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:24:37,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:24:37,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:24:37,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:24:37,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:24:37,985 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:24:37,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:24:37,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:24:37,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:24:37,986 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:24:37,986 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:24:38,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:24:38,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:24:38,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:24:38,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:24:38,057 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:24:38,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-10-27 12:24:38,126 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/81ffd8277/2b7cc23a74c642b2a5d1408f777f932e/FLAG4ec538eb9 [2018-10-27 12:24:38,735 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:24:38,737 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label55_true-unreach-call_false-termination.c [2018-10-27 12:24:38,760 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/81ffd8277/2b7cc23a74c642b2a5d1408f777f932e/FLAG4ec538eb9 [2018-10-27 12:24:38,774 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/81ffd8277/2b7cc23a74c642b2a5d1408f777f932e [2018-10-27 12:24:38,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:24:38,787 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:24:38,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:24:38,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:24:38,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:24:38,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:24:38" (1/1) ... [2018-10-27 12:24:38,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31eb09b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:38, skipping insertion in model container [2018-10-27 12:24:38,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:24:38" (1/1) ... [2018-10-27 12:24:38,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:24:38,877 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:24:39,372 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:24:39,378 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:24:39,476 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:24:39,497 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:24:39,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39 WrapperNode [2018-10-27 12:24:39,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:24:39,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:24:39,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:24:39,499 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:24:39,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:24:39,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:24:39,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:24:39,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:24:39,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... [2018-10-27 12:24:39,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:24:39,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:24:39,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:24:39,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:24:39,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:24:39,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:24:39,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:24:39,854 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:24:39,854 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:24:39,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:24:39,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:24:39,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:24:39,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:24:42,905 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:24:42,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:24:42 BoogieIcfgContainer [2018-10-27 12:24:42,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:24:42,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:24:42,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:24:42,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:24:42,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:24:38" (1/3) ... [2018-10-27 12:24:42,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25bc24ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:24:42, skipping insertion in model container [2018-10-27 12:24:42,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:24:39" (2/3) ... [2018-10-27 12:24:42,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25bc24ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:24:42, skipping insertion in model container [2018-10-27 12:24:42,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:24:42" (3/3) ... [2018-10-27 12:24:42,926 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label55_true-unreach-call_false-termination.c [2018-10-27 12:24:42,937 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:24:42,952 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:24:42,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:24:43,023 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:24:43,024 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:24:43,024 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:24:43,024 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:24:43,024 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:24:43,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:24:43,025 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:24:43,025 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:24:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:24:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 12:24:43,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:43,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:43,094 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:43,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -301102600, now seen corresponding path program 1 times [2018-10-27 12:24:43,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:43,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:43,761 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:24:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:43,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:24:43,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:24:43,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:43,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:24:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:24:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:24:43,932 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 12:24:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:45,579 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-10-27 12:24:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:24:45,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-10-27 12:24:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:45,603 INFO L225 Difference]: With dead ends: 627 [2018-10-27 12:24:45,603 INFO L226 Difference]: Without dead ends: 388 [2018-10-27 12:24:45,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:24:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-27 12:24:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-10-27 12:24:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-27 12:24:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-10-27 12:24:45,708 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 112 [2018-10-27 12:24:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:45,709 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-10-27 12:24:45,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:24:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-10-27 12:24:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 12:24:45,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:45,718 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:45,718 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:45,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash 178328325, now seen corresponding path program 1 times [2018-10-27 12:24:45,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:45,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:45,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:46,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:24:46,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:24:46,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:46,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:24:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:24:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:24:46,090 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-10-27 12:24:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:47,828 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-10-27 12:24:47,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:24:47,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-27 12:24:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:47,834 INFO L225 Difference]: With dead ends: 905 [2018-10-27 12:24:47,834 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 12:24:47,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:24:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 12:24:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 12:24:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 12:24:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-10-27 12:24:47,873 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 121 [2018-10-27 12:24:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:47,874 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-10-27 12:24:47,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:24:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-10-27 12:24:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-27 12:24:47,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:47,881 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:47,881 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:47,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1372472321, now seen corresponding path program 1 times [2018-10-27 12:24:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:47,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:47,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:47,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:24:48,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:24:48,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:48,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:24:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:24:48,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:24:48,129 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-10-27 12:24:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:50,963 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-10-27 12:24:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:24:50,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-10-27 12:24:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:50,976 INFO L225 Difference]: With dead ends: 1241 [2018-10-27 12:24:50,976 INFO L226 Difference]: Without dead ends: 865 [2018-10-27 12:24:50,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:24:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-27 12:24:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-10-27 12:24:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-27 12:24:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-10-27 12:24:51,064 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 123 [2018-10-27 12:24:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:51,065 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-10-27 12:24:51,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:24:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-10-27 12:24:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 12:24:51,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:51,070 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:51,070 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:51,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:51,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1586168017, now seen corresponding path program 1 times [2018-10-27 12:24:51,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:51,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:51,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:24:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:24:51,309 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:51,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:24:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:24:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:24:51,310 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 3 states. [2018-10-27 12:24:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:53,153 INFO L93 Difference]: Finished difference Result 2297 states and 3692 transitions. [2018-10-27 12:24:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:24:53,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-27 12:24:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:53,168 INFO L225 Difference]: With dead ends: 2297 [2018-10-27 12:24:53,168 INFO L226 Difference]: Without dead ends: 1485 [2018-10-27 12:24:53,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:24:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2018-10-27 12:24:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1478. [2018-10-27 12:24:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-10-27 12:24:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2327 transitions. [2018-10-27 12:24:53,239 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2327 transitions. Word has length 126 [2018-10-27 12:24:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:53,239 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 2327 transitions. [2018-10-27 12:24:53,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:24:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2327 transitions. [2018-10-27 12:24:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 12:24:53,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:53,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:53,246 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:53,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1132847554, now seen corresponding path program 1 times [2018-10-27 12:24:53,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:53,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:53,690 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 12:24:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:53,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:24:53,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:24:53,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:53,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:24:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:24:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:24:53,896 INFO L87 Difference]: Start difference. First operand 1478 states and 2327 transitions. Second operand 5 states. [2018-10-27 12:24:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:24:54,940 INFO L93 Difference]: Finished difference Result 3050 states and 4851 transitions. [2018-10-27 12:24:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:24:54,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-27 12:24:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:24:54,950 INFO L225 Difference]: With dead ends: 3050 [2018-10-27 12:24:54,950 INFO L226 Difference]: Without dead ends: 1430 [2018-10-27 12:24:54,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:24:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-27 12:24:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2018-10-27 12:24:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-10-27 12:24:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2227 transitions. [2018-10-27 12:24:55,003 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2227 transitions. Word has length 137 [2018-10-27 12:24:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:24:55,004 INFO L481 AbstractCegarLoop]: Abstraction has 1430 states and 2227 transitions. [2018-10-27 12:24:55,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:24:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2227 transitions. [2018-10-27 12:24:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 12:24:55,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:24:55,011 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:24:55,011 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:24:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2082625773, now seen corresponding path program 1 times [2018-10-27 12:24:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:24:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:24:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:24:55,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:24:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:24:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:24:55,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:24:55,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:24:55,952 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-27 12:24:55,954 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:24:56,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:24:56,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:24:57,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:24:57,629 INFO L272 AbstractInterpreter]: Visited 116 different actions 342 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:24:57,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:24:57,673 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:24:58,252 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 80.82% of their original sizes. [2018-10-27 12:24:58,252 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:24:59,231 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-10-27 12:24:59,231 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:24:59,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:24:59,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-10-27 12:24:59,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:24:59,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:24:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:24:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:24:59,235 INFO L87 Difference]: Start difference. First operand 1430 states and 2227 transitions. Second operand 11 states. [2018-10-27 12:25:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:25:13,248 INFO L93 Difference]: Finished difference Result 4506 states and 7188 transitions. [2018-10-27 12:25:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:25:13,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2018-10-27 12:25:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:25:13,265 INFO L225 Difference]: With dead ends: 4506 [2018-10-27 12:25:13,265 INFO L226 Difference]: Without dead ends: 3082 [2018-10-27 12:25:13,274 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:25:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2018-10-27 12:25:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3062. [2018-10-27 12:25:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2018-10-27 12:25:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4328 transitions. [2018-10-27 12:25:13,368 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4328 transitions. Word has length 163 [2018-10-27 12:25:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:25:13,369 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 4328 transitions. [2018-10-27 12:25:13,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:25:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4328 transitions. [2018-10-27 12:25:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-27 12:25:13,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:25:13,380 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:25:13,381 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:25:13,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:13,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1136314147, now seen corresponding path program 1 times [2018-10-27 12:25:13,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:25:13,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:13,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:13,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:13,382 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:25:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 93 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 12:25:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:13,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:25:13,645 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-10-27 12:25:13,645 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [151], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:25:13,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:25:13,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:25:14,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:25:14,214 INFO L272 AbstractInterpreter]: Visited 118 different actions 354 times. Merged at 8 different actions 24 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:25:14,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:14,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:25:14,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:14,221 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:25:14,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:14,230 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:25:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:14,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:25:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:25:14,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:25:14,841 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 12:25:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:25:15,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:25:15,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 12:25:15,017 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:25:15,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:25:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:25:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-10-27 12:25:15,018 INFO L87 Difference]: Start difference. First operand 3062 states and 4328 transitions. Second operand 11 states. [2018-10-27 12:25:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:25:23,258 INFO L93 Difference]: Finished difference Result 11149 states and 16667 transitions. [2018-10-27 12:25:23,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:25:23,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 191 [2018-10-27 12:25:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:25:23,282 INFO L225 Difference]: With dead ends: 11149 [2018-10-27 12:25:23,283 INFO L226 Difference]: Without dead ends: 5294 [2018-10-27 12:25:23,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 392 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-10-27 12:25:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2018-10-27 12:25:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 4909. [2018-10-27 12:25:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4909 states. [2018-10-27 12:25:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 5911 transitions. [2018-10-27 12:25:23,443 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 5911 transitions. Word has length 191 [2018-10-27 12:25:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:25:23,443 INFO L481 AbstractCegarLoop]: Abstraction has 4909 states and 5911 transitions. [2018-10-27 12:25:23,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:25:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 5911 transitions. [2018-10-27 12:25:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 12:25:23,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:25:23,458 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:25:23,458 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:25:23,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:23,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1262987757, now seen corresponding path program 1 times [2018-10-27 12:25:23,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:25:23,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:23,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:23,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:23,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:25:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:23,718 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:25:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 115 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 12:25:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:23,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:25:23,994 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-27 12:25:23,995 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:25:23,999 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:25:23,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:25:24,446 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:25:24,446 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:25:24,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:24,473 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:25:25,150 INFO L227 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 81.23% of their original sizes. [2018-10-27 12:25:25,150 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:25:27,012 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-10-27 12:25:27,012 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:25:27,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:25:27,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-10-27 12:25:27,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:25:27,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 12:25:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 12:25:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-10-27 12:25:27,014 INFO L87 Difference]: Start difference. First operand 4909 states and 5911 transitions. Second operand 20 states. [2018-10-27 12:25:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:25:42,863 INFO L93 Difference]: Finished difference Result 10553 states and 12654 transitions. [2018-10-27 12:25:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-27 12:25:42,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 221 [2018-10-27 12:25:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:25:42,884 INFO L225 Difference]: With dead ends: 10553 [2018-10-27 12:25:42,884 INFO L226 Difference]: Without dead ends: 5650 [2018-10-27 12:25:42,894 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 12:25:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2018-10-27 12:25:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5500. [2018-10-27 12:25:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5500 states. [2018-10-27 12:25:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5500 states to 5500 states and 6573 transitions. [2018-10-27 12:25:43,037 INFO L78 Accepts]: Start accepts. Automaton has 5500 states and 6573 transitions. Word has length 221 [2018-10-27 12:25:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:25:43,037 INFO L481 AbstractCegarLoop]: Abstraction has 5500 states and 6573 transitions. [2018-10-27 12:25:43,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 12:25:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5500 states and 6573 transitions. [2018-10-27 12:25:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-27 12:25:43,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:25:43,055 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:25:43,055 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:25:43,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -27762699, now seen corresponding path program 1 times [2018-10-27 12:25:43,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:25:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:43,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:43,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:25:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 123 proven. 54 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 12:25:43,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:43,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:25:43,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-10-27 12:25:43,488 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [99], [100], [104], [108], [112], [115], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:25:43,492 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:25:43,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:25:44,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:25:44,087 INFO L272 AbstractInterpreter]: Visited 119 different actions 359 times. Merged at 9 different actions 26 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:25:44,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:44,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:25:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:44,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:25:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:44,103 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:25:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:44,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:25:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-27 12:25:44,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:25:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-27 12:25:44,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:25:44,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-27 12:25:44,458 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:25:44,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:25:44,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:25:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:25:44,460 INFO L87 Difference]: Start difference. First operand 5500 states and 6573 transitions. Second operand 9 states. [2018-10-27 12:25:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:25:48,462 INFO L93 Difference]: Finished difference Result 13866 states and 16798 transitions. [2018-10-27 12:25:48,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 12:25:48,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2018-10-27 12:25:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:25:48,495 INFO L225 Difference]: With dead ends: 13866 [2018-10-27 12:25:48,495 INFO L226 Difference]: Without dead ends: 8218 [2018-10-27 12:25:48,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 12:25:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2018-10-27 12:25:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 7371. [2018-10-27 12:25:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7371 states. [2018-10-27 12:25:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 8314 transitions. [2018-10-27 12:25:48,696 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 8314 transitions. Word has length 225 [2018-10-27 12:25:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:25:48,697 INFO L481 AbstractCegarLoop]: Abstraction has 7371 states and 8314 transitions. [2018-10-27 12:25:48,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:25:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 8314 transitions. [2018-10-27 12:25:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-27 12:25:48,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:25:48,718 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-27 12:25:48,718 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:25:48,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:48,719 INFO L82 PathProgramCache]: Analyzing trace with hash 416589607, now seen corresponding path program 1 times [2018-10-27 12:25:48,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:25:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:48,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:25:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 162 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 12:25:49,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:49,254 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:25:49,255 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-10-27 12:25:49,255 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:25:49,258 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:25:49,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:25:50,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:25:50,416 INFO L272 AbstractInterpreter]: Visited 118 different actions 583 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:25:50,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:50,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:25:50,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:50,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:25:50,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:50,435 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:25:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:50,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:25:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-27 12:25:50,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:25:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 162 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 12:25:50,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:25:50,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 12:25:50,953 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:25:50,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:25:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:25:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:25:50,954 INFO L87 Difference]: Start difference. First operand 7371 states and 8314 transitions. Second operand 9 states. [2018-10-27 12:25:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:25:54,673 INFO L93 Difference]: Finished difference Result 17869 states and 20338 transitions. [2018-10-27 12:25:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 12:25:54,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 247 [2018-10-27 12:25:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:25:54,693 INFO L225 Difference]: With dead ends: 17869 [2018-10-27 12:25:54,694 INFO L226 Difference]: Without dead ends: 8374 [2018-10-27 12:25:54,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-10-27 12:25:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8374 states. [2018-10-27 12:25:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8374 to 8070. [2018-10-27 12:25:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8070 states. [2018-10-27 12:25:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 8795 transitions. [2018-10-27 12:25:54,888 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 8795 transitions. Word has length 247 [2018-10-27 12:25:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:25:54,888 INFO L481 AbstractCegarLoop]: Abstraction has 8070 states and 8795 transitions. [2018-10-27 12:25:54,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:25:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 8795 transitions. [2018-10-27 12:25:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-27 12:25:54,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:25:54,904 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-27 12:25:54,904 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:25:54,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash 595943546, now seen corresponding path program 1 times [2018-10-27 12:25:54,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:25:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:25:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:25:54,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:25:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:25:55,167 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:25:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 161 proven. 80 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 12:25:55,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:25:55,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:25:55,519 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-10-27 12:25:55,519 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [275], [278], [282], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [567], [569], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:25:55,523 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:25:55,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:25:55,966 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:25:55,966 INFO L272 AbstractInterpreter]: Visited 118 different actions 350 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:25:55,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:25:55,973 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:25:56,578 INFO L227 lantSequenceWeakener]: Weakened 270 states. On average, predicates are now at 80.77% of their original sizes. [2018-10-27 12:25:56,578 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:25:56,728 INFO L415 sIntCurrentIteration]: We unified 274 AI predicates to 274 [2018-10-27 12:25:56,728 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:25:56,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:25:56,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-27 12:25:56,728 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:25:56,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 12:25:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 12:25:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 12:25:56,730 INFO L87 Difference]: Start difference. First operand 8070 states and 8795 transitions. Second operand 12 states. [2018-10-27 12:26:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:26:01,815 INFO L93 Difference]: Finished difference Result 9191 states and 9974 transitions. [2018-10-27 12:26:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 12:26:01,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2018-10-27 12:26:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:26:01,816 INFO L225 Difference]: With dead ends: 9191 [2018-10-27 12:26:01,816 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:26:01,827 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-27 12:26:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:26:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:26:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:26:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:26:01,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2018-10-27 12:26:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:26:01,829 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:26:01,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 12:26:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:26:01,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:26:01,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:26:02,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:02,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:02,674 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 211 [2018-10-27 12:26:02,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:02,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:02,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:02,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:03,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:26:03,093 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 224 [2018-10-27 12:26:04,012 WARN L179 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-27 12:26:05,562 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2018-10-27 12:26:12,188 WARN L179 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 382 DAG size of output: 135 [2018-10-27 12:26:14,467 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 239 DAG size of output: 130 [2018-10-27 12:26:17,092 WARN L179 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 250 DAG size of output: 139 [2018-10-27 12:26:17,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:26:17,096 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a19~0)| ~a19~0) (<= ~a28~0 |old(~a28~0)|) (= ~a11~0 |old(~a11~0)|) (<= |old(~a28~0)| ~a28~0) (= ~a25~0 |old(~a25~0)|)) [2018-10-27 12:26:17,096 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:26:17,096 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:26:17,097 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:26:17,098 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:26:17,099 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:26:17,100 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,101 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:26:17,102 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,103 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:26:17,104 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,105 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:26:17,106 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,107 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,108 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:26:17,109 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,110 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:26:17,111 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,112 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:26:17,113 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 487) no Hoare annotation was computed. [2018-10-27 12:26:17,114 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,115 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,115 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,115 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse7 (= 1 |old(~a25~0)|)) (.cse6 (= 10 |old(~a28~0)|)) (.cse18 (= ~a25~0 1))) (let ((.cse11 (not .cse18)) (.cse19 (= ~a11~0 0)) (.cse22 (= ~a17~0 8)) (.cse27 (<= 8 ~a17~0)) (.cse21 (<= ~a28~0 |old(~a28~0)|)) (.cse33 (= 1 ~a11~0)) (.cse23 (<= |old(~a28~0)| ~a28~0)) (.cse24 (= ~a25~0 |old(~a25~0)|)) (.cse44 (not .cse6)) (.cse26 (not .cse7)) (.cse1 (not (= 1 ~a21~0))) (.cse29 (not (= 1 |old(~a19~0)|))) (.cse30 (< 1 |old(~a25~0)|)) (.cse38 (not (= 0 |old(~a11~0)|))) (.cse31 (< 11 |old(~a28~0)|)) (.cse32 (< |old(~a25~0)| 0)) (.cse39 (< |old(~a28~0)| 7)) (.cse8 (<= ~a17~0 |old(~a17~0)|)) (.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= ~a11~0 |old(~a11~0)|)) (.cse12 (not (= ~a28~0 10)))) (let ((.cse37 (and .cse8 .cse9 .cse10 .cse12)) (.cse15 (and (or .cse1 .cse44 .cse26 .cse38 (not (= 0 |old(~a19~0)|))) (or .cse1 .cse29 .cse30 .cse38 .cse31 .cse32 .cse39))) (.cse3 (< |old(~a17~0)| 8)) (.cse16 (< |old(~a28~0)| 9)) (.cse0 (and .cse8 .cse27 .cse9 .cse21 .cse33 .cse23 .cse24)) (.cse41 (< |old(~a19~0)| 1)) (.cse42 (and .cse9 .cse19 .cse21 .cse22 .cse24)) (.cse2 (< 7 |old(~a28~0)|)) (.cse40 (< |old(~a19~0)| 0)) (.cse4 (< 0 |old(~a19~0)|)) (.cse20 (= ~a19~0 1)) (.cse14 (< 6 |calculate_output_#in~input|)) (.cse25 (< |calculate_output_#in~input| 1)) (.cse43 (and .cse8 .cse9 .cse10 .cse11)) (.cse28 (= |old(~a11~0)| |old(~a19~0)|)) (.cse13 (< 7 |old(~a17~0)|)) (.cse34 (= 1 ~a25~0)) (.cse35 (= 8 ~a17~0)) (.cse36 (= 1 ~a19~0)) (.cse17 (not (= 8 |old(~a17~0)|))) (.cse5 (not (= 1 |old(~a11~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse3 .cse6 .cse0 .cse4 .cse5 .cse7) (or .cse1 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse6 .cse13 .cse7) (or .cse14 .cse15 .cse16 .cse17 (and (or .cse18 (and .cse19 .cse20)) .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse1 .cse2 (not (= |old(~a19~0)| 1)) .cse3 .cse26 (and .cse8 .cse9 .cse21 .cse10 .cse27 .cse24) .cse28) (or .cse14 .cse5 .cse7 (or .cse1 .cse29 .cse30 .cse16 .cse31 .cse32) .cse6 .cse17 (and .cse21 .cse20 .cse23 .cse24 .cse10 .cse22) .cse25) (or .cse1 .cse26 .cse29 .cse17 (and .cse33 .cse34 (= 9 ~a28~0) .cse35 .cse36) (not (= 9 |old(~a28~0)|)) .cse5) (or .cse1 .cse6 .cse37 .cse28 .cse13) (or .cse14 .cse1 .cse38 .cse32 .cse39 .cse40 .cse7 .cse30 .cse6 .cse31 (and .cse9 .cse19 .cse21 .cse22 .cse23 .cse24) .cse17 .cse4 .cse25) (or .cse1 .cse6 .cse37 .cse41 .cse13) (or .cse1 .cse3 .cse0 .cse28 .cse5 .cse41 .cse7) (or (and .cse23 .cse42) (or .cse14 .cse15 .cse26 .cse17 .cse25)) (or .cse1 .cse3 .cse0 .cse6 .cse28 .cse5 .cse41) (or .cse1 .cse3 .cse16 .cse6 .cse4 .cse5 .cse0) (or .cse1 .cse43 .cse41 .cse13 .cse7) (or (and .cse42 .cse23) (or .cse14 .cse1 .cse2 .cse38 .cse32 .cse39 .cse40 .cse30 .cse17 .cse4 .cse25)) (or (and .cse19 .cse22 .cse20 (= ~a28~0 7) .cse24) (or .cse14 .cse1 (not (= 7 |old(~a28~0)|)) .cse38 .cse29 .cse17 (not (= 0 |old(~a25~0)|)) .cse25)) (or .cse1 .cse43 .cse28 .cse13 .cse7) (or .cse1 .cse44 .cse26 .cse29 (and .cse33 .cse34 .cse35 .cse36 (= 10 ~a28~0)) .cse17 .cse5))))) [2018-10-27 12:26:17,115 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:26:17,116 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,117 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:26:17,118 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:26:17,119 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:26:17,120 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:26:17,121 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:26:17,122 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-27 12:26:17,122 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:26:17,122 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:26:17,123 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and (= ~a19~0 1) (= ~a28~0 7) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:26:17,123 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:26:17,123 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse23 (= ~a28~0 10)) (.cse24 (= ~a25~0 1)) (.cse0 (<= ~a17~0 |old(~a17~0)|)) (.cse18 (= ~a11~0 0)) (.cse22 (= ~a19~0 1)) (.cse11 (= ~a21~0 1))) (let ((.cse6 (and .cse0 (and .cse18 (= ~a25~0 0) .cse22 (= ~a28~0 7) .cse11))) (.cse10 (= 8 ~a17~0)) (.cse8 (not .cse24)) (.cse2 (= 1 ~a11~0)) (.cse3 (not (= ~a19~0 ~a11~0))) (.cse12 (<= 1 main_~input~0)) (.cse13 (<= main_~input~0 6)) (.cse21 (<= 9 ~a28~0)) (.cse17 (<= 0 ~a25~0)) (.cse15 (<= ~a25~0 1)) (.cse1 (<= ~a28~0 7)) (.cse14 (<= 7 ~a28~0)) (.cse19 (<= 0 ~a19~0)) (.cse9 (= 1 ~a25~0)) (.cse16 (<= ~a28~0 11)) (.cse20 (= ~a17~0 8)) (.cse7 (<= ~a17~0 7)) (.cse4 (<= 1 ~a19~0)) (.cse5 (not .cse23))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse3) (and (= (+ main_~output~0 1) 0) .cse6) (and .cse7 .cse8 .cse5) (and .cse2 .cse9 (= 9 ~a28~0) .cse10) (and .cse0 (= |old(~a19~0)| ~a19~0) .cse1 .cse9 .cse3) (not .cse11) (and .cse12 .cse13 .cse6) (not (= ~y~0 25)) (and (<= ~a19~0 0) .cse8 .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse7 .cse8 .cse3) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse7 .cse8 .cse4) (and .cse2 .cse9 .cse10 (= 1 ~a19~0) (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse8 .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse8 .cse3 .cse5) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse8 .cse5 (and .cse16 .cse17 .cse20 .cse15) .cse2 .cse21) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse5 .cse2 .cse21 .cse3) (and .cse7 .cse3 .cse5) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse12 .cse13 .cse18 .cse20 .cse21 (or (and .cse16 .cse17 .cse22 .cse15) (and .cse23 (= ~a19~0 0) .cse24))) (not (= ~a~0 1)) (and .cse1 .cse9 .cse14 .cse18 .cse19 (<= ~a19~0 1) .cse20) (not (= |old(~a17~0)| 8)) (and (and .cse9 .cse5 .cse16 .cse20 .cse22) (= ~a11~0 |old(~a11~0)|)) (not (= 6 ~f~0)) (and .cse7 .cse4 .cse5)))) [2018-10-27 12:26:17,123 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:26:17,123 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:26:17,124 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse21 (= ~a28~0 10)) (.cse22 (= ~a25~0 1))) (let ((.cse1 (<= ~a28~0 7)) (.cse9 (= 8 ~a17~0)) (.cse7 (not .cse22)) (.cse12 (<= 7 ~a28~0)) (.cse8 (= 1 ~a25~0)) (.cse16 (<= 0 ~a19~0)) (.cse17 (<= ~a19~0 1)) (.cse0 (<= ~a17~0 |old(~a17~0)|)) (.cse2 (= 1 ~a11~0)) (.cse3 (not (= ~a19~0 ~a11~0))) (.cse10 (<= 1 main_~input~0)) (.cse11 (<= main_~input~0 6)) (.cse15 (= ~a11~0 0)) (.cse18 (= ~a17~0 8)) (.cse20 (<= 9 ~a28~0)) (.cse19 (<= ~a28~0 11)) (.cse14 (<= 0 ~a25~0)) (.cse13 (<= ~a25~0 1)) (.cse6 (<= ~a17~0 7)) (.cse4 (<= 1 ~a19~0)) (.cse5 (not .cse21))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse7 .cse5) (and .cse2 .cse8 (= 9 ~a28~0) .cse9) (and .cse0 (= |old(~a19~0)| ~a19~0) .cse1 .cse8 .cse3) (not (= ~a21~0 1)) (and .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (not (= ~y~0 25)) (and .cse6 .cse7 .cse3) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse6 .cse7 .cse4) (and .cse2 .cse8 .cse9 (= 1 ~a19~0) (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse7 .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse10 .cse7 .cse11 .cse5 .cse2 (and .cse19 .cse14 .cse18 .cse20 .cse13)) (and (<= ~a19~0 0) .cse10 .cse7 .cse11 .cse12 .cse13 .cse5 .cse19 .cse14 .cse15 .cse16 .cse18) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and (and .cse10 .cse11 .cse8 .cse19 .cse16 .cse17 .cse18 .cse3) (= ~a11~0 |old(~a11~0)|)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse5 .cse2 .cse20 .cse3) (and .cse6 .cse3 .cse5) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (and .cse10 .cse11 .cse15 .cse18 .cse20 (or (and .cse19 .cse14 (= ~a19~0 1) .cse13) (and .cse21 (= ~a19~0 0) .cse22))) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)) (and .cse6 .cse4 .cse5)))) [2018-10-27 12:26:17,124 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:26:17,124 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:26:17,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:26:17 BoogieIcfgContainer [2018-10-27 12:26:17,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:26:17,147 INFO L168 Benchmark]: Toolchain (without parser) took 98360.76 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -610.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-27 12:26:17,148 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:26:17,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:26:17,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:26:17,149 INFO L168 Benchmark]: Boogie Preprocessor took 183.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2018-10-27 12:26:17,150 INFO L168 Benchmark]: RCFGBuilder took 3123.52 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: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. [2018-10-27 12:26:17,151 INFO L168 Benchmark]: TraceAbstraction took 94235.24 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 66.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-27 12:26:17,156 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.20 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 710.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -827.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3123.52 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: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94235.24 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 66.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 487]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a17 <= \old(a17) && a28 <= 7) && 1 == a11) && !(a19 == a11)) || ((((a17 <= \old(a17) && 1 <= a19) && !(a28 == 10)) && 1 == a11) && !(a19 == a11))) || (output + 1 == 0 && a17 <= \old(a17) && (((a11 == 0 && a25 == 0) && a19 == 1) && a28 == 7) && a21 == 1)) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 10))) || (((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17)) || ((((a17 <= \old(a17) && \old(a19) == a19) && a28 <= 7) && 1 == a25) && !(a19 == a11))) || !(a21 == 1)) || ((1 <= input && input <= 6) && a17 <= \old(a17) && (((a11 == 0 && a25 == 0) && a19 == 1) && a28 == 7) && a21 == 1)) || !(y == 25)) || (((((((((a19 <= 0 && !(a25 == 1)) && 7 <= a28) && a25 <= 1) && !(a28 == 10)) && a28 <= 11) && 0 <= a25) && a11 == 0) && 0 <= a19) && a17 == 8)) || ((a17 <= 7 && !(a25 == 1)) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || ((a17 <= 7 && !(a25 == 1)) && 1 <= a19)) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || ((((a17 <= \old(a17) && !(a25 == 1)) && 1 <= a19) && 1 == a11) && !(a19 == a11))) || ((((a17 <= \old(a17) && 1 == a11) && !(a25 == 1)) && !(a19 == a11)) && !(a28 == 10))) || !(21 == u)) || !(22 == v)) || ((((!(a25 == 1) && !(a28 == 10)) && ((a28 <= 11 && 0 <= a25) && a17 == 8) && a25 <= 1) && 1 == a11) && 9 <= a28)) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || ((((a17 <= \old(a17) && !(a28 == 10)) && 1 == a11) && 9 <= a28) && !(a19 == a11))) || ((a17 <= 7 && !(a19 == a11)) && !(a28 == 10))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || (((((1 <= input && input <= 6) && a11 == 0) && a17 == 8) && 9 <= a28) && ((((a28 <= 11 && 0 <= a25) && a19 == 1) && a25 <= 1) || ((a28 == 10 && a19 == 0) && a25 == 1)))) || !(a == 1)) || ((((((a28 <= 7 && 1 == a25) && 7 <= a28) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8)) || !(\old(a17) == 8)) || (((((1 == a25 && !(a28 == 10)) && a28 <= 11) && a17 == 8) && a19 == 1) && a11 == \old(a11))) || !(6 == f)) || ((a17 <= 7 && 1 <= a19) && !(a28 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 94.1s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 60.3s AutomataDifference, 0.0s DeadEndRemovalTime, 15.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1396 SDtfs, 13318 SDslu, 2094 SDs, 0 SdLazy, 19622 SolverSat, 3271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2201 GetRequests, 2002 SyntacticMatches, 11 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8070occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9969509079175506 AbsIntWeakeningRatio, 0.1951219512195122 AbsIntAvgWeakeningVarsNumRemoved, 22.597560975609756 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1765 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 257 PreInvPairs, 376 NumberOfFragments, 1983 HoareAnnotationTreeSize, 257 FomulaSimplifications, 19588 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22380 FormulaSimplificationTreeSizeReductionInter, 13.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 2099/2355 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...