java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:54:40,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:54:40,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:54:40,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:54:40,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:54:40,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:54:40,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:54:40,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:54:40,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:54:40,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:54:40,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:54:40,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:54:40,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:54:40,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:54:40,192 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:54:40,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:54:40,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:54:40,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:54:40,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:54:40,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:54:40,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:54:40,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:54:40,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:54:40,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:54:40,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:54:40,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:54:40,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:54:40,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:54:40,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:54:40,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:54:40,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:54:40,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:54:40,211 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:54:40,211 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:54:40,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:54:40,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:54:40,216 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:54:40,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:54:40,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:54:40,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:54:40,235 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:54:40,235 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:54:40,236 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:54:40,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:54:40,236 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:54:40,236 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:54:40,236 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:54:40,237 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:54:40,237 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:54:40,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:54:40,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:54:40,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:54:40,238 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:54:40,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:54:40,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:54:40,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:54:40,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:54:40,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:54:40,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:54:40,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:54:40,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:54:40,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:54:40,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:54:40,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:54:40,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:54:40,240 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:54:40,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:54:40,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:54:40,242 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:54:40,243 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:54:40,243 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:54:40,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:54:40,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:54:40,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:54:40,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:54:40,323 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:54:40,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label29_true-unreach-call_false-termination.c [2018-11-07 12:54:40,388 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41ffa41f/6da36cc651f54d24bc4059f6a3d2ac19/FLAG2966b8d1c [2018-11-07 12:54:41,021 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:54:41,024 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label29_true-unreach-call_false-termination.c [2018-11-07 12:54:41,045 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41ffa41f/6da36cc651f54d24bc4059f6a3d2ac19/FLAG2966b8d1c [2018-11-07 12:54:41,068 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41ffa41f/6da36cc651f54d24bc4059f6a3d2ac19 [2018-11-07 12:54:41,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:54:41,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:54:41,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:54:41,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:54:41,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:54:41,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9c8864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41, skipping insertion in model container [2018-11-07 12:54:41,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:54:41,153 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:54:41,652 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:54:41,664 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:54:41,789 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:54:41,810 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:54:41,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41 WrapperNode [2018-11-07 12:54:41,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:54:41,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:54:41,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:54:41,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:54:41,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:54:41,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:54:41,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:54:41,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:54:41,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:41,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:42,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... [2018-11-07 12:54:42,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:54:42,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:54:42,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:54:42,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:54:42,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:54:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:54:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:54:42,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:54:42,182 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:54:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:54:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:54:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:54:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:54:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:54:45,457 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:54:45,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:45 BoogieIcfgContainer [2018-11-07 12:54:45,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:54:45,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:54:45,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:54:45,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:54:45,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:54:41" (1/3) ... [2018-11-07 12:54:45,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67ca3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:45, skipping insertion in model container [2018-11-07 12:54:45,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:54:41" (2/3) ... [2018-11-07 12:54:45,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f67ca3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:54:45, skipping insertion in model container [2018-11-07 12:54:45,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:54:45" (3/3) ... [2018-11-07 12:54:45,471 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label29_true-unreach-call_false-termination.c [2018-11-07 12:54:45,480 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:54:45,488 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:54:45,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:54:45,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:54:45,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:54:45,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:54:45,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:54:45,546 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:54:45,546 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:54:45,546 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:54:45,546 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:54:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:54:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 12:54:45,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:45,589 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] [2018-11-07 12:54:45,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:45,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash 150214839, now seen corresponding path program 1 times [2018-11-07 12:54:45,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:45,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:45,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:54:46,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:46,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:46,256 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:54:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:47,846 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-07 12:54:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:47,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-11-07 12:54:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:47,868 INFO L225 Difference]: With dead ends: 627 [2018-11-07 12:54:47,868 INFO L226 Difference]: Without dead ends: 388 [2018-11-07 12:54:47,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-07 12:54:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-07 12:54:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-07 12:54:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-07 12:54:47,951 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 109 [2018-11-07 12:54:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:47,953 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-07 12:54:47,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-07 12:54:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 12:54:47,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:47,961 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] [2018-11-07 12:54:47,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:47,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 348320458, now seen corresponding path program 1 times [2018-11-07 12:54:47,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:47,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:48,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:54:48,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:48,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:48,191 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 3 states. [2018-11-07 12:54:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:49,490 INFO L93 Difference]: Finished difference Result 1053 states and 1768 transitions. [2018-11-07 12:54:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:49,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-11-07 12:54:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:49,500 INFO L225 Difference]: With dead ends: 1053 [2018-11-07 12:54:49,500 INFO L226 Difference]: Without dead ends: 676 [2018-11-07 12:54:49,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-07 12:54:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2018-11-07 12:54:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-11-07 12:54:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1011 transitions. [2018-11-07 12:54:49,552 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1011 transitions. Word has length 118 [2018-11-07 12:54:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:49,553 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 1011 transitions. [2018-11-07 12:54:49,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1011 transitions. [2018-11-07 12:54:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 12:54:49,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:49,560 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] [2018-11-07 12:54:49,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:49,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1318631550, now seen corresponding path program 1 times [2018-11-07 12:54:49,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:49,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:49,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:54:49,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:54:49,801 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:49,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:49,802 INFO L87 Difference]: Start difference. First operand 676 states and 1011 transitions. Second operand 3 states. [2018-11-07 12:54:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:51,785 INFO L93 Difference]: Finished difference Result 1926 states and 2979 transitions. [2018-11-07 12:54:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:51,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-11-07 12:54:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:51,798 INFO L225 Difference]: With dead ends: 1926 [2018-11-07 12:54:51,799 INFO L226 Difference]: Without dead ends: 1256 [2018-11-07 12:54:51,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:54:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2018-11-07 12:54:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2018-11-07 12:54:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-07 12:54:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1828 transitions. [2018-11-07 12:54:51,882 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1828 transitions. Word has length 123 [2018-11-07 12:54:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:51,883 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 1828 transitions. [2018-11-07 12:54:51,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1828 transitions. [2018-11-07 12:54:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 12:54:51,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:51,894 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:51,894 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:51,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1684085040, now seen corresponding path program 1 times [2018-11-07 12:54:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:51,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:52,194 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:54:52,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:52,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:52,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-07 12:54:52,444 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [59], [63], [64], [68], [72], [76], [79], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [543], [545], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:52,493 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:52,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:53,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:53,330 INFO L272 AbstractInterpreter]: Visited 110 different actions 110 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:54:53,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:53,366 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:54,124 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 81.01% of their original sizes. [2018-11-07 12:54:54,124 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:55,678 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-07 12:54:55,679 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:55,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:54:55,680 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:55,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:54:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:54:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:54:55,682 INFO L87 Difference]: Start difference. First operand 1256 states and 1828 transitions. Second operand 14 states. [2018-11-07 12:55:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:11,738 INFO L93 Difference]: Finished difference Result 2806 states and 4098 transitions. [2018-11-07 12:55:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 12:55:11,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-11-07 12:55:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:11,749 INFO L225 Difference]: With dead ends: 2806 [2018-11-07 12:55:11,750 INFO L226 Difference]: Without dead ends: 1556 [2018-11-07 12:55:11,755 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:55:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-07 12:55:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1403. [2018-11-07 12:55:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1403 states. [2018-11-07 12:55:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1989 transitions. [2018-11-07 12:55:11,807 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1989 transitions. Word has length 155 [2018-11-07 12:55:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:11,808 INFO L480 AbstractCegarLoop]: Abstraction has 1403 states and 1989 transitions. [2018-11-07 12:55:11,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:55:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1989 transitions. [2018-11-07 12:55:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 12:55:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:11,815 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] [2018-11-07 12:55:11,815 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -47073822, now seen corresponding path program 1 times [2018-11-07 12:55:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:11,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:55:12,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:12,082 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:12,082 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 12:55:12,082 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], [543], [545], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:12,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:12,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:12,767 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:12,767 INFO L272 AbstractInterpreter]: Visited 113 different actions 333 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:55:12,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:12,811 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:13,137 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-07 12:55:13,138 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:13,283 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 12:55:13,283 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:13,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:13,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-07 12:55:13,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:13,286 INFO L87 Difference]: Start difference. First operand 1403 states and 1989 transitions. Second operand 11 states. [2018-11-07 12:55:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:21,936 INFO L93 Difference]: Finished difference Result 3708 states and 5591 transitions. [2018-11-07 12:55:21,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:55:21,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-11-07 12:55:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:21,948 INFO L225 Difference]: With dead ends: 3708 [2018-11-07 12:55:21,949 INFO L226 Difference]: Without dead ends: 2311 [2018-11-07 12:55:21,957 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-07 12:55:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2018-11-07 12:55:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2295. [2018-11-07 12:55:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2018-11-07 12:55:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3194 transitions. [2018-11-07 12:55:22,024 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 3194 transitions. Word has length 160 [2018-11-07 12:55:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:22,025 INFO L480 AbstractCegarLoop]: Abstraction has 2295 states and 3194 transitions. [2018-11-07 12:55:22,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:55:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 3194 transitions. [2018-11-07 12:55:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-07 12:55:22,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:22,034 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:22,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:22,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash -726569558, now seen corresponding path program 1 times [2018-11-07 12:55:22,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:22,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:22,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 71 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 12:55:22,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:22,347 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:22,347 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-07 12:55:22,348 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [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], [543], [545], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:22,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:22,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:22,951 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:22,952 INFO L272 AbstractInterpreter]: Visited 115 different actions 462 times. Merged at 8 different actions 35 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:22,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:22,986 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:23,324 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 80.82% of their original sizes. [2018-11-07 12:55:23,325 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:23,490 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-07 12:55:23,490 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:23,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:23,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-07 12:55:23,491 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:23,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:23,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:23,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:55:23,492 INFO L87 Difference]: Start difference. First operand 2295 states and 3194 transitions. Second operand 11 states. [2018-11-07 12:55:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:34,915 INFO L93 Difference]: Finished difference Result 6664 states and 9272 transitions. [2018-11-07 12:55:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 12:55:34,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 181 [2018-11-07 12:55:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:34,933 INFO L225 Difference]: With dead ends: 6664 [2018-11-07 12:55:34,933 INFO L226 Difference]: Without dead ends: 3630 [2018-11-07 12:55:34,943 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-07 12:55:34,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-11-07 12:55:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3611. [2018-11-07 12:55:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3611 states. [2018-11-07 12:55:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 4794 transitions. [2018-11-07 12:55:35,052 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 4794 transitions. Word has length 181 [2018-11-07 12:55:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:35,053 INFO L480 AbstractCegarLoop]: Abstraction has 3611 states and 4794 transitions. [2018-11-07 12:55:35,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:55:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 4794 transitions. [2018-11-07 12:55:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 12:55:35,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:35,066 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 12:55:35,066 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:35,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2092371857, now seen corresponding path program 1 times [2018-11-07 12:55:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:35,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:35,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:35,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:35,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 104 proven. 41 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:55:35,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:35,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:35,253 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-07 12:55:35,253 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [75], [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], [543], [545], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:35,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:35,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:35,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:35,895 INFO L272 AbstractInterpreter]: Visited 116 different actions 348 times. Merged at 8 different actions 24 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:35,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:35,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:35,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:35,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:35,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:36,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-07 12:55:36,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-07 12:55:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:36,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:55:36,833 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:36,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:55:36,835 INFO L87 Difference]: Start difference. First operand 3611 states and 4794 transitions. Second operand 11 states. [2018-11-07 12:55:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:42,556 INFO L93 Difference]: Finished difference Result 10173 states and 13985 transitions. [2018-11-07 12:55:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:55:42,558 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 199 [2018-11-07 12:55:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:42,581 INFO L225 Difference]: With dead ends: 10173 [2018-11-07 12:55:42,581 INFO L226 Difference]: Without dead ends: 4860 [2018-11-07 12:55:42,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 409 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 12:55:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2018-11-07 12:55:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4456. [2018-11-07 12:55:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2018-11-07 12:55:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5179 transitions. [2018-11-07 12:55:42,753 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5179 transitions. Word has length 199 [2018-11-07 12:55:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:42,754 INFO L480 AbstractCegarLoop]: Abstraction has 4456 states and 5179 transitions. [2018-11-07 12:55:42,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:55:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5179 transitions. [2018-11-07 12:55:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 12:55:42,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:42,770 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:55:42,770 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:42,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash 66586733, now seen corresponding path program 1 times [2018-11-07 12:55:42,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:42,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:42,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:42,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 243 proven. 132 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-07 12:55:43,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:43,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:43,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-11-07 12:55:43,347 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [56], [59], [63], [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], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [275], [278], [282], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [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], [543], [545], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:43,355 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:43,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:45,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:55:45,144 INFO L272 AbstractInterpreter]: Visited 119 different actions 584 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:55:45,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:45,182 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:55:45,872 INFO L227 lantSequenceWeakener]: Weakened 340 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-07 12:55:45,872 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:55:46,169 INFO L415 sIntCurrentIteration]: We unified 345 AI predicates to 345 [2018-11-07 12:55:46,169 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:55:46,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:55:46,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:55:46,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:55:46,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:55:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:55:46,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:55:46,172 INFO L87 Difference]: Start difference. First operand 4456 states and 5179 transitions. Second operand 14 states. [2018-11-07 12:55:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:56,529 INFO L93 Difference]: Finished difference Result 6972 states and 8076 transitions. [2018-11-07 12:55:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:55:56,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 346 [2018-11-07 12:55:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:56,530 INFO L225 Difference]: With dead ends: 6972 [2018-11-07 12:55:56,530 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:55:56,545 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 360 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-11-07 12:55:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:55:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:55:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:55:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:55:56,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 346 [2018-11-07 12:55:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:55:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:55:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:55:56,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:55:56,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:55:56,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,251 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 209 [2018-11-07 12:55:57,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:57,635 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 163 [2018-11-07 12:55:58,224 WARN L179 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-07 12:55:58,443 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 77 [2018-11-07 12:56:04,468 WARN L179 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 304 DAG size of output: 128 [2018-11-07 12:56:05,722 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2018-11-07 12:56:07,106 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 245 DAG size of output: 117 [2018-11-07 12:56:07,110 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:56:07,110 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)) [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:56:07,111 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:56:07,112 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,113 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:56:07,114 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,115 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:56:07,116 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,117 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:56:07,118 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:56:07,119 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:56:07,120 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:56:07,121 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:56:07,122 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,123 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:56:07,124 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:56:07,125 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,126 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,127 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse22 (= ~a25~0 1)) (.cse21 (< |old(~a19~0)| 0)) (.cse5 (< |old(~a28~0)| 7)) (.cse8 (< 1 |old(~a25~0)|)) (.cse32 (< 1 |old(~a11~0)|)) (.cse29 (< 1 |old(~a19~0)|)) (.cse28 (not (= 1 ~a21~0)))) (let ((.cse0 (<= ~a28~0 10)) (.cse3 (let ((.cse33 (< (+ |old(~a19~0)| 1) 0))) (and (or .cse29 .cse28 .cse33 .cse8 .cse32) (or .cse29 .cse28 (< |old(~a28~0)| 8) .cse33 (< 3 |old(~a25~0)|))))) (.cse6 (< 10 |old(~a28~0)|)) (.cse12 (<= 7 ~a28~0)) (.cse16 (<= ~a25~0 1)) (.cse13 (<= 0 ~a25~0)) (.cse24 (= ~a11~0 0)) (.cse26 (= 1 ~a19~0)) (.cse15 (= ~a17~0 8)) (.cse20 (let ((.cse30 (< |old(~a11~0)| 0)) (.cse31 (< 11 |old(~a28~0)|))) (and (or .cse29 .cse28 .cse30 .cse8 .cse31 .cse5 .cse21) (or .cse29 .cse28 .cse30 .cse8 .cse32 .cse31 .cse5)))) (.cse4 (< |old(~a25~0)| 0)) (.cse11 (not (= 1 |old(~a11~0)|))) (.cse14 (= 1 ~a11~0)) (.cse27 (<= ~a17~0 |old(~a17~0)|)) (.cse23 (= |old(~a19~0)| ~a19~0)) (.cse17 (not .cse22)) (.cse25 (< 0 |old(~a19~0)|)) (.cse18 (< 7 |old(~a17~0)|)) (.cse19 (= 1 |old(~a25~0)|)) (.cse1 (< 6 |calculate_output_#in~input|)) (.cse2 (not (= 0 |old(~a11~0)|))) (.cse7 (not (= 1 |old(~a19~0)|))) (.cse9 (not (= 8 |old(~a17~0)|))) (.cse10 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse3 .cse4 .cse11 .cse5 (and (<= ~a25~0 3) .cse12 .cse13 .cse14 .cse15 (or (and .cse0 .cse16) (and .cse0 (<= 8 ~a28~0)))) .cse6 .cse9 .cse10) (or .cse7 .cse17 .cse18 .cse19) (or .cse1 (or (not (= 10 |old(~a28~0)|)) (not .cse19) .cse2) .cse20 .cse21 .cse9 (and (or (and (= ~a28~0 10) .cse22) (= ~a19~0 1)) .cse23 .cse24 .cse15) .cse10) (or .cse17 .cse25 .cse11 .cse19) (or .cse1 .cse20 .cse17 .cse2 .cse4 .cse19 .cse7 .cse9 .cse10) (or .cse1 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse26 .cse10) (or (and .cse17 .cse12 .cse16 .cse23 .cse13 .cse24 (<= ~a28~0 8) .cse15) .cse1 .cse20 .cse2 .cse4 .cse21 .cse19 (< 8 |old(~a28~0)|) .cse9 .cse25 .cse10) (or .cse7 (and .cse27 .cse26) .cse18) (or .cse1 .cse3 .cse4 .cse11 .cse5 .cse19 .cse6 .cse17 .cse9 .cse10) (or .cse1 (and .cse12 .cse16 (<= ~a28~0 11) .cse13 .cse24 .cse26 .cse15) .cse20 .cse2 .cse4 .cse7 .cse9 .cse10) (or (and .cse27 .cse23 .cse14) .cse25 .cse11) (or .cse7 .cse11 .cse14 .cse18) (or (and .cse27 .cse23 .cse17) .cse25 .cse18 .cse19) (or (or .cse28 .cse1 (not (= 7 |old(~a28~0)|))) .cse2 .cse7 (= ~a28~0 7) .cse9 (not (= 0 |old(~a25~0)|)) .cse10)))) [2018-11-07 12:56:07,127 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,127 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,127 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 478) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:56:07,128 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,129 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:56:07,130 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,131 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:56:07,132 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:56:07,133 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:56:07,134 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-11-07 12:56:07,134 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:56:07,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:56:07,135 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)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= ~a28~0 7) (= ~a17~0 8)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:56:07,135 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:56:07,135 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse13 (= ~a25~0 1))) (let ((.cse1 (<= ~a19~0 0)) (.cse3 (not .cse13)) (.cse0 (<= ~a17~0 7)) (.cse12 (= 1 ~a19~0)) (.cse4 (<= 1 main_~input~0)) (.cse5 (<= main_~input~0 6)) (.cse9 (= ~a11~0 0)) (.cse2 (= 1 ~a11~0)) (.cse6 (<= 7 ~a28~0)) (.cse7 (<= ~a25~0 1)) (.cse8 (<= 0 ~a25~0)) (.cse10 (<= ~a19~0 1)) (.cse11 (= ~a17~0 8))) (or (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse1 .cse2) (not (= |old(~a11~0)| 0)) (and (<= ~a17~0 |old(~a17~0)|) .cse1 .cse3 .cse2) (not (= ~z~0 26)) (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 ~a19~0) .cse10 .cse11 (<= ~a28~0 8)) (not (= 0 |old(~a25~0)|)) (and .cse11 (= ~a28~0 7) (and .cse9 (= ~a25~0 0) .cse12)) (not (= 3 ~c~0)) (and .cse0 .cse2 .cse12) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse11 (and .cse4 .cse5 (or (and (= ~a28~0 10) (= ~a19~0 0) .cse9 .cse13) (and (<= ~a28~0 11) .cse8 .cse9 (= ~a19~0 1) .cse6 .cse7)))) (and .cse2 (let ((.cse14 (<= ~a28~0 10)) (.cse15 (<= 0 (+ ~a19~0 1)))) (or (and .cse8 .cse10 .cse14 .cse11 .cse6 .cse15 .cse7) (and (<= ~a25~0 3) .cse8 .cse10 .cse14 .cse11 .cse15 (<= 8 ~a28~0))))) (not (= 6 ~f~0))))) [2018-11-07 12:56:07,135 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:56:07,135 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:56:07,136 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse13 (= ~a25~0 1))) (let ((.cse10 (<= ~a19~0 0)) (.cse9 (<= ~a17~0 7)) (.cse5 (= 1 ~a11~0)) (.cse11 (not .cse13)) (.cse7 (<= ~a19~0 1)) (.cse8 (= ~a17~0 8)) (.cse4 (<= 1 main_~input~0)) (.cse6 (<= main_~input~0 6)) (.cse0 (<= 0 ~a25~0)) (.cse12 (= ~a11~0 0)) (.cse2 (<= 7 ~a28~0)) (.cse3 (<= ~a25~0 1))) (or (and (let ((.cse1 (<= ~a28~0 10))) (or (and (<= ~a25~0 3) .cse0 .cse1 (<= 8 ~a28~0)) (and .cse0 .cse1 .cse2 .cse3))) .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 (+ ~a19~0 1))) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse9 .cse10 .cse5) (not (= |old(~a11~0)| 0)) (and (<= ~a17~0 |old(~a17~0)|) .cse10 .cse11 .cse5) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and .cse9 .cse5 (= 1 ~a19~0)) (not (= 23 ~w~0)) (and .cse11 .cse4 .cse6 .cse2 .cse3 .cse12 .cse0 (<= 0 ~a19~0) .cse7 (<= ~a28~0 8) .cse8) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (and .cse8 (and .cse4 .cse6 (or (and (= ~a28~0 10) (= ~a19~0 0) .cse12 .cse13) (and (<= ~a28~0 11) .cse0 .cse12 (= ~a19~0 1) .cse2 .cse3)))) (not (= 6 ~f~0))))) [2018-11-07 12:56:07,136 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:56:07,136 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:56:07,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:56:07 BoogieIcfgContainer [2018-11-07 12:56:07,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:56:07,155 INFO L168 Benchmark]: Toolchain (without parser) took 86075.39 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,156 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:56:07,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.65 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 59.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -130.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,159 INFO L168 Benchmark]: Boogie Preprocessor took 138.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,159 INFO L168 Benchmark]: RCFGBuilder took 3443.10 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 775.9 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -682.3 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,160 INFO L168 Benchmark]: TraceAbstraction took 81695.39 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 12:56:07,166 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.22 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 729.41 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 63.65 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 59.8 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -130.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.61 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3443.10 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 775.9 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -682.3 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81695.39 ms. Allocated memory was 2.4 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 3.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 478]: 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: ((((((((((((((((((((((!(a21 == 1) || !(y == 25)) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((a17 <= 7 && a19 <= 0) && 1 == a11)) || !(\old(a11) == 0)) || (((a17 <= \old(a17) && a19 <= 0) && !(a25 == 1)) && 1 == a11)) || !(z == 26)) || ((((((((((1 <= input && !(a25 == 1)) && input <= 6) && 7 <= a28) && a25 <= 1) && 0 <= a25) && a11 == 0) && 0 <= a19) && a19 <= 1) && a17 == 8) && a28 <= 8)) || !(0 == \old(a25))) || ((a17 == 8 && a28 == 7) && (a11 == 0 && a25 == 0) && 1 == a19)) || !(3 == c)) || ((a17 <= 7 && 1 == a11) && 1 == a19)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || (a17 == 8 && (1 <= input && input <= 6) && ((((a28 == 10 && a19 == 0) && a11 == 0) && a25 == 1) || (((((a28 <= 11 && 0 <= a25) && a11 == 0) && a19 == 1) && 7 <= a28) && a25 <= 1)))) || (1 == a11 && (((((((0 <= a25 && a19 <= 1) && a28 <= 10) && a17 == 8) && 7 <= a28) && 0 <= a19 + 1) && a25 <= 1) || ((((((a25 <= 3 && 0 <= a25) && a19 <= 1) && a28 <= 10) && a17 == 8) && 0 <= a19 + 1) && 8 <= a28)))) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 81.6s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 57.3s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1523 SDtfs, 7564 SDslu, 2049 SDs, 0 SdLazy, 11100 SolverSat, 1986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1351 GetRequests, 1213 SyntacticMatches, 7 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4456occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9969765271779869 AbsIntWeakeningRatio, 0.20405727923627684 AbsIntAvgWeakeningVarsNumRemoved, 27.83890214797136 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 597 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 139 PreInvPairs, 223 NumberOfFragments, 1559 HoareAnnotationTreeSize, 139 FomulaSimplifications, 21153 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16970 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 727041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 1042/1286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...