java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:09:14,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:09:14,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:09:14,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:09:14,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:09:14,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:09:14,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:09:14,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:09:14,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:09:14,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:09:14,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:09:14,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:09:14,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:09:14,495 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:09:14,496 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:09:14,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:09:14,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:09:14,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:09:14,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:09:14,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:09:14,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:09:14,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:09:14,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:09:14,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:09:14,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:09:14,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:09:14,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:09:14,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:09:14,511 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:09:14,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:09:14,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:09:14,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:09:14,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:09:14,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:09:14,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:09:14,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:09:14,516 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:09:14,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:09:14,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:09:14,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:09:14,540 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:09:14,541 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:09:14,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:09:14,541 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:09:14,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:09:14,541 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:09:14,542 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:09:14,542 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:09:14,542 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:09:14,542 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:09:14,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:09:14,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:09:14,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:09:14,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:09:14,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:09:14,544 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:09:14,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:09:14,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:09:14,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:09:14,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:09:14,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:09:14,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:09:14,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:09:14,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:09:14,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:09:14,547 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:09:14,547 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:09:14,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:09:14,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:09:14,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:09:14,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:09:14,614 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:09:14,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-12 17:09:14,678 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70b4b3d9/fba91daffac146048c449db18490a197/FLAGd78afc997 [2018-11-12 17:09:15,269 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:09:15,270 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-12 17:09:15,286 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70b4b3d9/fba91daffac146048c449db18490a197/FLAGd78afc997 [2018-11-12 17:09:15,301 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70b4b3d9/fba91daffac146048c449db18490a197 [2018-11-12 17:09:15,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:09:15,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:09:15,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:15,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:09:15,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:09:15,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:15" (1/1) ... [2018-11-12 17:09:15,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec7ce7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:15, skipping insertion in model container [2018-11-12 17:09:15,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:15" (1/1) ... [2018-11-12 17:09:15,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:09:15,395 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:09:15,840 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:15,846 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:09:16,007 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:09:16,029 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:09:16,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16 WrapperNode [2018-11-12 17:09:16,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:09:16,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:16,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:09:16,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:09:16,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:09:16,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:09:16,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:09:16,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:09:16,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (1/1) ... [2018-11-12 17:09:16,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:09:16,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:09:16,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:09:16,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:09:16,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (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-12 17:09:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:09:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:09:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:09:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:09:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:09:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:09:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:09:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:09:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:09:19,249 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:09:19,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:19 BoogieIcfgContainer [2018-11-12 17:09:19,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:09:19,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:09:19,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:09:19,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:09:19,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:09:15" (1/3) ... [2018-11-12 17:09:19,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec58b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:19, skipping insertion in model container [2018-11-12 17:09:19,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:16" (2/3) ... [2018-11-12 17:09:19,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec58b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:19, skipping insertion in model container [2018-11-12 17:09:19,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:19" (3/3) ... [2018-11-12 17:09:19,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-11-12 17:09:19,269 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:09:19,278 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:09:19,294 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:09:19,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:09:19,345 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:09:19,345 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:09:19,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:09:19,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:09:19,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:09:19,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:09:19,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:09:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-12 17:09:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-12 17:09:19,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:19,399 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] [2018-11-12 17:09:19,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:19,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-11-12 17:09:19,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:19,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:19,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:19,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:20,180 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-12 17:09:20,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:20,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:20,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:20,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:20,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:20,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:20,212 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-12 17:09:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:21,930 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-12 17:09:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:21,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-12 17:09:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:21,951 INFO L225 Difference]: With dead ends: 550 [2018-11-12 17:09:21,952 INFO L226 Difference]: Without dead ends: 340 [2018-11-12 17:09:21,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-12 17:09:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-12 17:09:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-12 17:09:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-12 17:09:22,039 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-11-12 17:09:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:22,042 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-12 17:09:22,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-12 17:09:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 17:09:22,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:22,053 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:22,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:22,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-11-12 17:09:22,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:22,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:22,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:22,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:22,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:22,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:22,249 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-12 17:09:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:23,969 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-12 17:09:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:23,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-12 17:09:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:23,977 INFO L225 Difference]: With dead ends: 888 [2018-11-12 17:09:23,977 INFO L226 Difference]: Without dead ends: 554 [2018-11-12 17:09:23,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-12 17:09:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-12 17:09:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-12 17:09:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-12 17:09:24,025 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-11-12 17:09:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:24,025 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-12 17:09:24,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-12 17:09:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-12 17:09:24,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:24,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:24,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:24,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-11-12 17:09:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:24,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:24,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:24,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:24,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:24,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:24,447 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-12 17:09:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:26,083 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-12 17:09:26,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:09:26,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-12 17:09:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:26,094 INFO L225 Difference]: With dead ends: 1210 [2018-11-12 17:09:26,094 INFO L226 Difference]: Without dead ends: 536 [2018-11-12 17:09:26,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-12 17:09:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-12 17:09:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-12 17:09:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-12 17:09:26,151 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-11-12 17:09:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:26,151 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-12 17:09:26,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:09:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-12 17:09:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 17:09:26,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:26,155 INFO L375 BasicCegarLoop]: trace histogram [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-12 17:09:26,156 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:26,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-11-12 17:09:26,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:26,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:26,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:26,579 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-12 17:09:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:26,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:26,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:09:26,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:26,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:09:26,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:09:26,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:26,708 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-12 17:09:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:28,949 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-12 17:09:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:09:28,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-12 17:09:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:28,954 INFO L225 Difference]: With dead ends: 1204 [2018-11-12 17:09:28,954 INFO L226 Difference]: Without dead ends: 535 [2018-11-12 17:09:28,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:09:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-12 17:09:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-12 17:09:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-12 17:09:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-12 17:09:28,975 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-11-12 17:09:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:28,975 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-12 17:09:28,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:09:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-12 17:09:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 17:09:28,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:28,978 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:09:28,979 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:28,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-11-12 17:09:28,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:28,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:29,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:09:29,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:29,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:09:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:09:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:09:29,172 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-12 17:09:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:30,537 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-11-12 17:09:30,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:09:30,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-12 17:09:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:30,551 INFO L225 Difference]: With dead ends: 1522 [2018-11-12 17:09:30,551 INFO L226 Difference]: Without dead ends: 993 [2018-11-12 17:09:30,554 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-12 17:09:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-12 17:09:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-11-12 17:09:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-11-12 17:09:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-11-12 17:09:30,590 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-11-12 17:09:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:30,591 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-11-12 17:09:30,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:09:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-11-12 17:09:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 17:09:30,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:30,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:09:30,596 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:30,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-11-12 17:09:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:30,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:30,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:30,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:30,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:09:30,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:09:30,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:30,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:09:30,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:09:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:09:30,799 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-11-12 17:09:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:31,825 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-11-12 17:09:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:09:31,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-12 17:09:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:31,849 INFO L225 Difference]: With dead ends: 2917 [2018-11-12 17:09:31,849 INFO L226 Difference]: Without dead ends: 1930 [2018-11-12 17:09:31,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:09:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-12 17:09:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-11-12 17:09:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-12 17:09:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-11-12 17:09:31,937 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-11-12 17:09:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:31,938 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-11-12 17:09:31,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:09:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-11-12 17:09:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:09:31,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:31,945 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:09:31,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:31,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-11-12 17:09:31,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:31,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:31,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:32,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:32,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:32,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-11-12 17:09:32,207 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:32,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:32,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:32,941 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:32,943 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Performed 881 root evaluator evaluations with a maximum evaluation depth of 6. Performed 881 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 42 variables. [2018-11-12 17:09:32,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:32,988 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:33,557 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 79.56% of their original sizes. [2018-11-12 17:09:33,558 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:34,838 INFO L415 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2018-11-12 17:09:34,838 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:34,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:34,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-12 17:09:34,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:34,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:09:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:09:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:09:34,842 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 12 states. [2018-11-12 17:09:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:09:46,726 INFO L93 Difference]: Finished difference Result 3805 states and 5126 transitions. [2018-11-12 17:09:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:09:46,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-11-12 17:09:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:09:46,736 INFO L225 Difference]: With dead ends: 3805 [2018-11-12 17:09:46,737 INFO L226 Difference]: Without dead ends: 1936 [2018-11-12 17:09:46,743 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:09:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-12 17:09:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2018-11-12 17:09:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-11-12 17:09:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2591 transitions. [2018-11-12 17:09:46,792 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2591 transitions. Word has length 142 [2018-11-12 17:09:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:09:46,792 INFO L480 AbstractCegarLoop]: Abstraction has 1936 states and 2591 transitions. [2018-11-12 17:09:46,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:09:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2591 transitions. [2018-11-12 17:09:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-12 17:09:46,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:09:46,798 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:09:46,798 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:09:46,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-11-12 17:09:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:09:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:09:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:09:46,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:09:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:09:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:09:46,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:09:46,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:09:46,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-11-12 17:09:46,941 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:09:46,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:09:46,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:09:47,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:09:47,795 INFO L272 AbstractInterpreter]: Visited 112 different actions 180 times. Merged at 5 different actions 7 times. Never widened. Performed 3483 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:09:47,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:09:47,829 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:09:48,535 INFO L227 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 81.21% of their original sizes. [2018-11-12 17:09:48,536 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:09:49,746 INFO L415 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2018-11-12 17:09:49,747 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:09:49,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:09:49,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:09:49,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:09:49,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:09:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:09:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:09:49,749 INFO L87 Difference]: Start difference. First operand 1936 states and 2591 transitions. Second operand 19 states. [2018-11-12 17:10:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:06,393 INFO L93 Difference]: Finished difference Result 4090 states and 5483 transitions. [2018-11-12 17:10:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 17:10:06,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2018-11-12 17:10:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:06,404 INFO L225 Difference]: With dead ends: 4090 [2018-11-12 17:10:06,404 INFO L226 Difference]: Without dead ends: 2221 [2018-11-12 17:10:06,411 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:10:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2018-11-12 17:10:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2210. [2018-11-12 17:10:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2018-11-12 17:10:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2885 transitions. [2018-11-12 17:10:06,482 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2885 transitions. Word has length 144 [2018-11-12 17:10:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:06,483 INFO L480 AbstractCegarLoop]: Abstraction has 2210 states and 2885 transitions. [2018-11-12 17:10:06,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:10:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2885 transitions. [2018-11-12 17:10:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-12 17:10:06,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:06,496 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:10:06,496 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:06,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1984849738, now seen corresponding path program 1 times [2018-11-12 17:10:06,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:06,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:10:06,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:06,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:06,828 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-12 17:10:06,829 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:06,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:06,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:07,497 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:07,497 INFO L272 AbstractInterpreter]: Visited 112 different actions 289 times. Merged at 7 different actions 15 times. Never widened. Performed 5220 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:07,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:07,537 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:08,255 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 80.23% of their original sizes. [2018-11-12 17:10:08,256 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:08,472 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-12 17:10:08,472 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 17:10:08,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:08,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:10:08,474 INFO L87 Difference]: Start difference. First operand 2210 states and 2885 transitions. Second operand 11 states. [2018-11-12 17:10:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:18,413 INFO L93 Difference]: Finished difference Result 5326 states and 7114 transitions. [2018-11-12 17:10:18,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 17:10:18,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2018-11-12 17:10:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:18,429 INFO L225 Difference]: With dead ends: 5326 [2018-11-12 17:10:18,429 INFO L226 Difference]: Without dead ends: 3457 [2018-11-12 17:10:18,437 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:10:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2018-11-12 17:10:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3449. [2018-11-12 17:10:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-12 17:10:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4387 transitions. [2018-11-12 17:10:18,524 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4387 transitions. Word has length 184 [2018-11-12 17:10:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:18,525 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4387 transitions. [2018-11-12 17:10:18,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4387 transitions. [2018-11-12 17:10:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-12 17:10:18,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:18,535 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-12 17:10:18,535 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:18,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1644608177, now seen corresponding path program 1 times [2018-11-12 17:10:18,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:18,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:19,054 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:10:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:10:19,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:19,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:19,243 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-12 17:10:19,243 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:19,252 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:19,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:19,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:19,901 INFO L272 AbstractInterpreter]: Visited 113 different actions 182 times. Merged at 5 different actions 7 times. Never widened. Performed 3636 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3636 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:19,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:19,941 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:21,034 INFO L227 lantSequenceWeakener]: Weakened 86 states. On average, predicates are now at 80.87% of their original sizes. [2018-11-12 17:10:21,035 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:22,352 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-12 17:10:22,352 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:22,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:22,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-12 17:10:22,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:22,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 17:10:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 17:10:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-12 17:10:22,353 INFO L87 Difference]: Start difference. First operand 3449 states and 4387 transitions. Second operand 25 states. [2018-11-12 17:10:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:45,130 INFO L93 Difference]: Finished difference Result 6977 states and 8895 transitions. [2018-11-12 17:10:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:10:45,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 192 [2018-11-12 17:10:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:45,146 INFO L225 Difference]: With dead ends: 6977 [2018-11-12 17:10:45,146 INFO L226 Difference]: Without dead ends: 3869 [2018-11-12 17:10:45,154 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 162 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 17:10:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2018-11-12 17:10:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3587. [2018-11-12 17:10:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3587 states. [2018-11-12 17:10:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4530 transitions. [2018-11-12 17:10:45,245 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4530 transitions. Word has length 192 [2018-11-12 17:10:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:45,245 INFO L480 AbstractCegarLoop]: Abstraction has 3587 states and 4530 transitions. [2018-11-12 17:10:45,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 17:10:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4530 transitions. [2018-11-12 17:10:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-12 17:10:45,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:45,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:10:45,258 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:45,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:45,258 INFO L82 PathProgramCache]: Analyzing trace with hash -199400556, now seen corresponding path program 1 times [2018-11-12 17:10:45,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:45,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:45,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:10:45,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:45,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:45,593 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-12 17:10:45,594 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:45,596 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:45,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:46,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:10:46,968 INFO L272 AbstractInterpreter]: Visited 115 different actions 529 times. Merged at 9 different actions 42 times. Never widened. Performed 8403 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8403 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:46,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:46,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:10:46,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:46,976 INFO L192 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-12 17:10:46,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:46,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:10:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:47,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:10:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-12 17:10:47,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:10:47,819 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 17:10:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:10:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:10:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 17:10:48,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:10:48,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:10:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:10:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:10:48,325 INFO L87 Difference]: Start difference. First operand 3587 states and 4530 transitions. Second operand 11 states. [2018-11-12 17:10:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:50,455 INFO L93 Difference]: Finished difference Result 8010 states and 10227 transitions. [2018-11-12 17:10:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 17:10:50,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2018-11-12 17:10:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:50,473 INFO L225 Difference]: With dead ends: 8010 [2018-11-12 17:10:50,473 INFO L226 Difference]: Without dead ends: 4628 [2018-11-12 17:10:50,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:10:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2018-11-12 17:10:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4480. [2018-11-12 17:10:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4480 states. [2018-11-12 17:10:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 4480 states and 5551 transitions. [2018-11-12 17:10:50,596 INFO L78 Accepts]: Start accepts. Automaton has 4480 states and 5551 transitions. Word has length 201 [2018-11-12 17:10:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:50,597 INFO L480 AbstractCegarLoop]: Abstraction has 4480 states and 5551 transitions. [2018-11-12 17:10:50,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:10:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4480 states and 5551 transitions. [2018-11-12 17:10:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-12 17:10:50,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:50,613 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:10:50,613 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash 498005062, now seen corresponding path program 1 times [2018-11-12 17:10:50,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:50,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:50,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:50,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:51,160 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:10:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 114 proven. 47 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 17:10:51,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:51,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:51,203 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-11-12 17:10:51,204 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:51,206 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:51,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:51,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:51,909 INFO L272 AbstractInterpreter]: Visited 114 different actions 296 times. Merged at 7 different actions 16 times. Never widened. Performed 5008 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:10:51,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:51,913 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:52,283 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 80.24% of their original sizes. [2018-11-12 17:10:52,283 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:52,387 INFO L415 sIntCurrentIteration]: We unified 209 AI predicates to 209 [2018-11-12 17:10:52,387 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-12 17:10:52,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:52,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:10:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:10:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:10:52,388 INFO L87 Difference]: Start difference. First operand 4480 states and 5551 transitions. Second operand 10 states. [2018-11-12 17:10:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:10:57,609 INFO L93 Difference]: Finished difference Result 8901 states and 11079 transitions. [2018-11-12 17:10:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:10:57,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-11-12 17:10:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:10:57,627 INFO L225 Difference]: With dead ends: 8901 [2018-11-12 17:10:57,628 INFO L226 Difference]: Without dead ends: 4764 [2018-11-12 17:10:57,815 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:10:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2018-11-12 17:10:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4758. [2018-11-12 17:10:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4758 states. [2018-11-12 17:10:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 5859 transitions. [2018-11-12 17:10:57,922 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 5859 transitions. Word has length 210 [2018-11-12 17:10:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:10:57,923 INFO L480 AbstractCegarLoop]: Abstraction has 4758 states and 5859 transitions. [2018-11-12 17:10:57,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:10:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 5859 transitions. [2018-11-12 17:10:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-12 17:10:57,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:10:57,937 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-12 17:10:57,937 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:10:57,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1741191685, now seen corresponding path program 1 times [2018-11-12 17:10:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:10:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:10:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:10:57,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:10:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:10:58,444 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 17:10:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 116 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:10:58,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:10:58,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:10:58,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-12 17:10:58,613 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:10:58,616 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:10:58,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:10:58,894 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:10:58,894 INFO L272 AbstractInterpreter]: Visited 113 different actions 180 times. Merged at 5 different actions 5 times. Never widened. Performed 2396 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-12 17:10:58,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:10:58,904 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:10:59,291 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 79.98% of their original sizes. [2018-11-12 17:10:59,291 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:10:59,581 INFO L415 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-11-12 17:10:59,581 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:10:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:10:59,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:10:59,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:10:59,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:10:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:10:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:10:59,583 INFO L87 Difference]: Start difference. First operand 4758 states and 5859 transitions. Second operand 18 states. [2018-11-12 17:11:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:12,510 INFO L93 Difference]: Finished difference Result 9034 states and 11217 transitions. [2018-11-12 17:11:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:11:12,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 214 [2018-11-12 17:11:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:12,528 INFO L225 Difference]: With dead ends: 9034 [2018-11-12 17:11:12,529 INFO L226 Difference]: Without dead ends: 4897 [2018-11-12 17:11:12,538 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:11:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2018-11-12 17:11:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 4896. [2018-11-12 17:11:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2018-11-12 17:11:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6004 transitions. [2018-11-12 17:11:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6004 transitions. Word has length 214 [2018-11-12 17:11:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:12,638 INFO L480 AbstractCegarLoop]: Abstraction has 4896 states and 6004 transitions. [2018-11-12 17:11:12,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:11:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6004 transitions. [2018-11-12 17:11:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-12 17:11:12,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:12,651 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:12,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:12,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1025909234, now seen corresponding path program 1 times [2018-11-12 17:11:12,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:12,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:12,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 114 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:11:12,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:12,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:12,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-11-12 17:11:12,890 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:12,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:12,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:13,396 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:11:13,396 INFO L272 AbstractInterpreter]: Visited 114 different actions 297 times. Merged at 7 different actions 17 times. Never widened. Performed 4562 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-12 17:11:13,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:13,404 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:11:13,720 INFO L227 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 80.25% of their original sizes. [2018-11-12 17:11:13,721 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:11:13,816 INFO L415 sIntCurrentIteration]: We unified 222 AI predicates to 222 [2018-11-12 17:11:13,816 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:11:13,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-12 17:11:13,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:13,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:11:13,818 INFO L87 Difference]: Start difference. First operand 4896 states and 6004 transitions. Second operand 11 states. [2018-11-12 17:11:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:20,290 INFO L93 Difference]: Finished difference Result 10292 states and 12675 transitions. [2018-11-12 17:11:20,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 17:11:20,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-11-12 17:11:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:20,308 INFO L225 Difference]: With dead ends: 10292 [2018-11-12 17:11:20,308 INFO L226 Difference]: Without dead ends: 5877 [2018-11-12 17:11:20,318 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-12 17:11:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2018-11-12 17:11:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5866. [2018-11-12 17:11:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5866 states. [2018-11-12 17:11:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7060 transitions. [2018-11-12 17:11:20,437 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7060 transitions. Word has length 223 [2018-11-12 17:11:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:20,438 INFO L480 AbstractCegarLoop]: Abstraction has 5866 states and 7060 transitions. [2018-11-12 17:11:20,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7060 transitions. [2018-11-12 17:11:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-12 17:11:20,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:20,454 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:20,454 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:20,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:20,454 INFO L82 PathProgramCache]: Analyzing trace with hash -988575688, now seen corresponding path program 1 times [2018-11-12 17:11:20,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:20,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:20,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:20,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:20,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:21,432 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:11:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:11:21,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:21,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:21,608 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-11-12 17:11:21,608 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:21,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:21,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:23,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:11:23,342 INFO L272 AbstractInterpreter]: Visited 115 different actions 652 times. Merged at 9 different actions 60 times. Widened at 1 different actions 2 times. Performed 10801 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10801 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:11:23,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:23,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:11:23,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:23,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:11:23,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:23,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:11:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:23,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:11:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-12 17:11:24,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:11:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-12 17:11:24,623 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:11:24,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-12 17:11:24,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:24,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:11:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:11:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:11:24,627 INFO L87 Difference]: Start difference. First operand 5866 states and 7060 transitions. Second operand 3 states. [2018-11-12 17:11:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:25,317 INFO L93 Difference]: Finished difference Result 13686 states and 16901 transitions. [2018-11-12 17:11:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:11:25,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-11-12 17:11:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:25,342 INFO L225 Difference]: With dead ends: 13686 [2018-11-12 17:11:25,343 INFO L226 Difference]: Without dead ends: 8163 [2018-11-12 17:11:25,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 450 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:11:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8163 states. [2018-11-12 17:11:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8163 to 7945. [2018-11-12 17:11:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7945 states. [2018-11-12 17:11:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7945 states to 7945 states and 9608 transitions. [2018-11-12 17:11:25,513 INFO L78 Accepts]: Start accepts. Automaton has 7945 states and 9608 transitions. Word has length 226 [2018-11-12 17:11:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:25,514 INFO L480 AbstractCegarLoop]: Abstraction has 7945 states and 9608 transitions. [2018-11-12 17:11:25,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:11:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7945 states and 9608 transitions. [2018-11-12 17:11:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-12 17:11:25,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:25,534 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:11:25,534 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:25,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1371913748, now seen corresponding path program 1 times [2018-11-12 17:11:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:25,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:25,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:11:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:25,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:11:25,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-12 17:11:25,962 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-12 17:11:25,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:11:25,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:11:27,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:11:27,323 INFO L272 AbstractInterpreter]: Visited 115 different actions 535 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Performed 8801 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8801 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-12 17:11:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:27,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:11:27,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:11:27,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:11:27,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:27,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:11:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:27,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:11:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:11:27,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:11:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 17:11:27,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:11:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-12 17:11:27,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:11:27,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:11:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:11:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:11:27,796 INFO L87 Difference]: Start difference. First operand 7945 states and 9608 transitions. Second operand 11 states. [2018-11-12 17:11:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:31,847 INFO L93 Difference]: Finished difference Result 16495 states and 22680 transitions. [2018-11-12 17:11:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 17:11:31,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-11-12 17:11:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:31,848 INFO L225 Difference]: With dead ends: 16495 [2018-11-12 17:11:31,848 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:11:31,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 17:11:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:11:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:11:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:11:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:11:31,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2018-11-12 17:11:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:31,906 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:11:31,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:11:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:11:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:11:31,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:11:32,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:32,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:32,585 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-12 17:11:32,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:32,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:32,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:33,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,279 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 443 DAG size of output: 313 [2018-11-12 17:11:34,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:34,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:11:35,429 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 434 DAG size of output: 303 [2018-11-12 17:11:36,547 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-12 17:11:38,817 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 147 DAG size of output: 86 [2018-11-12 17:11:45,351 WARN L179 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 357 DAG size of output: 175 [2018-11-12 17:11:47,361 WARN L179 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 341 DAG size of output: 109 [2018-11-12 17:11:49,400 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 332 DAG size of output: 109 [2018-11-12 17:11:49,403 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:49,403 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-12 17:11:49,403 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,404 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-12 17:11:49,405 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-12 17:11:49,406 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-12 17:11:49,407 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-12 17:11:49,408 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,409 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-12 17:11:49,410 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,411 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,412 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-12 17:11:49,413 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-12 17:11:49,414 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-12 17:11:49,415 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,416 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-12 17:11:49,417 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-12 17:11:49,419 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-12 17:11:49,419 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-12 17:11:49,419 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-12 17:11:49,419 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 13 |old(~a8~0)|)) (.cse33 (= 4 |old(~a16~0)|)) (.cse32 (= ~a16~0 |old(~a16~0)|)) (.cse29 (= ~a7~0 |old(~a7~0)|)) (.cse30 (= |old(~a8~0)| ~a8~0)) (.cse28 (= |old(~a20~0)| ~a20~0)) (.cse31 (<= ~a21~0 |old(~a21~0)|)) (.cse36 (= |old(~a16~0)| ~a16~0)) (.cse4 (<= ~a17~0 0))) (let ((.cse7 (and .cse29 .cse30 .cse28 .cse31 .cse36 .cse4)) (.cse9 (= ~a17~0 1)) (.cse15 (and .cse28 .cse4 .cse29 .cse30 .cse31 .cse32)) (.cse16 (not .cse33)) (.cse34 (= 1 ~a20~0)) (.cse35 (= 13 ~a8~0)) (.cse37 (= 1 ~a21~0)) (.cse38 (= 1 ~a17~0)) (.cse39 (not .cse1)) (.cse19 (not (= 1 |old(~a17~0)|))) (.cse0 (= 1 |old(~a7~0)|)) (.cse6 (not (= 1 |old(~a20~0)|))) (.cse3 (< 0 |old(~a17~0)|)) (.cse14 (= 6 |old(~a16~0)|)) (.cse8 (< 0 |old(~a21~0)|)) (.cse13 (and .cse29 .cse30 .cse28 .cse31 .cse36)) (.cse25 (<= 0 ~a17~0)) (.cse27 (= ~a21~0 1)) (.cse26 (<= ~a17~0 1)) (.cse12 (< 6 |calculate_output_#in~input|)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse17 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 8 ~a12~0))) (.cse24 (< 1 |old(~a17~0)|)) (.cse18 (< |old(~a20~0)| 0)) (.cse21 (< 6 |old(~a16~0)|)) (.cse20 (not (= 15 |old(~a8~0)|))) (.cse23 (< |old(~a16~0)| 4)) (.cse22 (< |old(~a17~0)| 0)) (.cse5 (< 0 |old(~a20~0)|)) (.cse10 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse2 .cse3 .cse8) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) .cse9 (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse10 .cse11 .cse12 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse0 .cse13 .cse1 .cse2 .cse5) (or .cse14 .cse1 .cse7 .cse2 .cse3 .cse5) (or .cse0 .cse15 .cse6 .cse16 .cse2 .cse3) (or .cse14 .cse6 .cse2 .cse13 .cse8) (or .cse12 (or .cse11 .cse17 (not (= 5 |old(~a16~0)|)) .cse2 .cse18 .cse19) .cse20 .cse9 .cse5 .cse10) (or .cse12 (and (or .cse11 .cse17 .cse21 (< |old(~a16~0)| 5) .cse6 .cse22 .cse2) (or .cse11 .cse17 .cse21 (not (= 0 |old(~a17~0)|)) .cse23 .cse2 (< 1 |old(~a20~0)|) .cse18)) .cse24 .cse20 (and .cse25 .cse26 .cse27) .cse10) (or .cse0 .cse6 (and .cse28 .cse29 .cse30 .cse31 .cse32) .cse1 .cse2) (or .cse0 .cse4 .cse16 .cse2 .cse3 .cse5) (or .cse14 .cse33 .cse6 .cse1 .cse15 .cse2 .cse3) (or .cse17 .cse6 .cse16 (and (= 1 ~a7~0) .cse34 .cse35 .cse36 .cse37 .cse38) .cse2 (not .cse0) .cse39 .cse19) (or .cse0 .cse16 .cse2 .cse13 .cse5) (or .cse13 .cse0 .cse33 .cse6 .cse2) (or .cse17 .cse0 .cse6 .cse16 .cse2 (and (not (= ~a7~0 1)) .cse34 .cse35 .cse36 .cse37 .cse38) .cse39 .cse19) (or .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (or .cse14 .cse2 .cse8 .cse5 .cse13) (or (and .cse25 .cse27 .cse26) .cse12 .cse11 .cse17 .cse2 .cse24 .cse18 .cse21 .cse20 .cse23 .cse22 .cse5 .cse10)))) [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,420 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-12 17:11:49,421 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-12 17:11:49,422 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-12 17:11:49,423 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-12 17:11:49,424 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-12 17:11:49,425 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:11:49,426 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-12 17:11:49,426 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:11:49,426 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:11:49,426 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:11:49,426 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:49,427 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 4 ~d~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse5 .cse3 .cse6) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse8 .cse9) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-11-12 17:11:49,427 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-12 17:11:49,427 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-12 17:11:49,427 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-12 17:11:49,427 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse5 (<= ~a21~0 0)) (.cse8 (= |old(~a20~0)| ~a20~0)) (.cse3 (= 1 ~a20~0)) (.cse6 (not (= ~a16~0 6))) (.cse4 (not (= ~a8~0 13))) (.cse9 (not .cse1)) (.cse7 (<= ~a17~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) (= 1 ~a17~0)) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse4 .cse2) (not (= 4 ~d~0)) (and .cse5 .cse6 .cse2) (and .cse0 .cse3 .cse4) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse0 .cse3 .cse7) (and .cse6 .cse7 .cse4 .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse5 .cse3 .cse6) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse8 .cse9) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse5 .cse8 .cse7) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)) (and (and .cse3 .cse6 .cse4 .cse9) .cse7)))) [2018-11-12 17:11:49,427 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-12 17:11:49,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:11:49 BoogieIcfgContainer [2018-11-12 17:11:49,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:11:49,444 INFO L168 Benchmark]: Toolchain (without parser) took 154131.68 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:49,445 INFO L168 Benchmark]: CDTParser took 0.18 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-12 17:11:49,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.57 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-12 17:11:49,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:49,447 INFO L168 Benchmark]: Boogie Preprocessor took 105.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:49,448 INFO L168 Benchmark]: RCFGBuilder took 2984.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:11:49,449 INFO L168 Benchmark]: TraceAbstraction took 150192.10 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -904.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:11:49,454 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.18 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 715.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 129.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -839.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2984.76 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.1 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150192.10 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -904.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && a20 <= 0) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && !(a8 == 13)) && a20 <= 0)) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && 1 == a20) && !(a8 == 13))) || !(2 == b)) || !(y == 25)) || ((!(a7 == 1) && 1 == a20) && a17 <= 0)) || (((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) && a20 <= 0)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || !(21 == u)) || !(22 == v)) || ((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4))) || !(z == 26)) || !(\old(a16) == 5)) || ((a21 <= 0 && \old(a20) == a20) && a17 <= 0)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f)) || ((((1 == a20 && !(a16 == 6)) && !(a8 == 13)) && !(a16 == 4)) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 150.0s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 103.0s AutomataDifference, 0.0s DeadEndRemovalTime, 17.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2409 SDtfs, 10950 SDslu, 3109 SDs, 0 SdLazy, 17698 SolverSat, 2238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2827 GetRequests, 2552 SyntacticMatches, 23 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7945occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.1s AbstIntTime, 10 AbstIntIterations, 7 AbstIntStrong, 0.9973053662419682 AbsIntWeakeningRatio, 0.21121351766513058 AbsIntAvgWeakeningVarsNumRemoved, 27.023041474654377 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 755 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 492 PreInvPairs, 942 NumberOfFragments, 1396 HoareAnnotationTreeSize, 492 FomulaSimplifications, 27066 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 29900 FormulaSimplificationTreeSizeReductionInter, 13.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 3355 NumberOfCodeBlocks, 3355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 2293162 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1825 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 2439/2882 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...