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_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:42:17,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:42:17,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:42:17,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:42:17,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:42:17,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:42:17,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:42:17,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:42:17,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:42:17,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:42:17,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:42:17,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:42:17,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:42:17,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:42:17,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:42:17,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:42:17,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:42:17,372 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:42:17,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:42:17,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:42:17,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:42:17,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:42:17,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:42:17,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:42:17,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:42:17,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:42:17,390 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:42:17,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:42:17,394 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:42:17,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:42:17,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:42:17,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:42:17,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:42:17,400 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:42:17,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:42:17,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:42:17,402 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:42:17,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:42:17,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:42:17,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:42:17,418 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:42:17,418 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:42:17,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:42:17,418 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:42:17,419 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:42:17,419 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:42:17,419 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:42:17,419 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:42:17,419 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:42:17,420 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:42:17,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:42:17,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:42:17,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:42:17,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:42:17,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:42:17,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:42:17,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:42:17,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:42:17,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:42:17,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:42:17,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:42:17,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:42:17,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:42:17,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:42:17,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:42:17,423 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:42:17,423 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:42:17,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:42:17,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:42:17,424 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:42:17,424 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:42:17,424 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:42:17,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:42:17,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:42:17,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:42:17,506 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:42:17,506 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:42:17,507 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 18:42:17,571 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed6f5a4d/59dead7ce95545cc9fc7ed3ed28b2d0f/FLAG52c451a02 [2018-11-07 18:42:18,144 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:42:18,147 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 18:42:18,167 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed6f5a4d/59dead7ce95545cc9fc7ed3ed28b2d0f/FLAG52c451a02 [2018-11-07 18:42:18,187 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed6f5a4d/59dead7ce95545cc9fc7ed3ed28b2d0f [2018-11-07 18:42:18,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:42:18,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:42:18,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:42:18,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:42:18,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:42:18,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:18,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41600c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18, skipping insertion in model container [2018-11-07 18:42:18,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:18,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:42:18,276 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:42:18,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:42:18,782 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:42:18,899 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:42:18,919 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:42:18,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18 WrapperNode [2018-11-07 18:42:18,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:42:18,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:42:18,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:42:18,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:42:18,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:42:19,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:42:19,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:42:19,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:42:19,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... [2018-11-07 18:42:19,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:42:19,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:42:19,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:42:19,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:42:19,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:42:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:42:19,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:42:19,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:42:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:42:19,251 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:42:19,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:42:19,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:42:19,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:42:19,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:42:22,554 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:42:22,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:42:22 BoogieIcfgContainer [2018-11-07 18:42:22,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:42:22,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:42:22,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:42:22,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:42:22,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:42:18" (1/3) ... [2018-11-07 18:42:22,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ba73d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:42:22, skipping insertion in model container [2018-11-07 18:42:22,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:42:18" (2/3) ... [2018-11-07 18:42:22,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ba73d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:42:22, skipping insertion in model container [2018-11-07 18:42:22,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:42:22" (3/3) ... [2018-11-07 18:42:22,564 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-11-07 18:42:22,574 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:42:22,584 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:42:22,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:42:22,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:42:22,639 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:42:22,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:42:22,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:42:22,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:42:22,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:42:22,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:42:22,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:42:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:42:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 18:42:22,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:22,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:22,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:22,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-11-07 18:42:22,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:22,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:23,384 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:42:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:42:23,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:23,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:42:23,486 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:23,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:42:23,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:42:23,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:42:23,512 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 18:42:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:25,136 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 18:42:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:42:25,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-07 18:42:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:25,159 INFO L225 Difference]: With dead ends: 550 [2018-11-07 18:42:25,160 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 18:42:25,167 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-07 18:42:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 18:42:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 18:42:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:42:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 18:42:25,248 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-11-07 18:42:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:25,249 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 18:42:25,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:42:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 18:42:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 18:42:25,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:25,256 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:25,257 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-11-07 18:42:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:25,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:25,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:25,491 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-07 18:42:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:42:25,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:25,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:42:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:42:25,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:42:25,495 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 18:42:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:27,339 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 18:42:27,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:42:27,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-11-07 18:42:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:27,345 INFO L225 Difference]: With dead ends: 888 [2018-11-07 18:42:27,345 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 18:42:27,352 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-07 18:42:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 18:42:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 18:42:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 18:42:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 18:42:27,393 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-11-07 18:42:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:27,393 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 18:42:27,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:42:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 18:42:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 18:42:27,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:27,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:27,398 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:27,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-11-07 18:42:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:27,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:27,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:27,791 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 18:42:27,922 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-07 18:42:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:27,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:42:27,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:27,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:42:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:42:27,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:42:27,924 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 18:42:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:30,011 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 18:42:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:42:30,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-11-07 18:42:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:30,018 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 18:42:30,019 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 18:42:30,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:42:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 18:42:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 18:42:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 18:42:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 18:42:30,069 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-11-07 18:42:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 18:42:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:42:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 18:42:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 18:42:30,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:30,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:30,077 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:30,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-11-07 18:42:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:30,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:30,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:30,776 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 18:42:30,905 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-07 18:42:30,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:30,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:42:30,905 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:30,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:42:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:42:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:42:30,907 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 18:42:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:32,779 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 18:42:32,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:42:32,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-07 18:42:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:32,783 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 18:42:32,784 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 18:42:32,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:42:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 18:42:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 18:42:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 18:42:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 18:42:32,802 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-11-07 18:42:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 18:42:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:42:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 18:42:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 18:42:32,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:32,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:32,806 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:32,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-11-07 18:42:32,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:32,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:32,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:33,036 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-07 18:42:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:42:33,037 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:33,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:42:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:42:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:42:33,038 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 18:42:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:34,271 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 18:42:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:42:34,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-11-07 18:42:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:34,279 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 18:42:34,279 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 18:42:34,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:42:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 18:42:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 18:42:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 18:42:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 18:42:34,315 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-11-07 18:42:34,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:34,316 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 18:42:34,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:42:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 18:42:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 18:42:34,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:34,321 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:34,321 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:34,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-11-07 18:42:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:34,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:34,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:34,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:34,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:34,489 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:42:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:42:34,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:42:34,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:42:34,513 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:34,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:42:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:42:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:42:34,514 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 18:42:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:35,592 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 18:42:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:42:35,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-11-07 18:42:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:35,608 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 18:42:35,608 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 18:42:35,616 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-07 18:42:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 18:42:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 18:42:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 18:42:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 18:42:35,688 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-11-07 18:42:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:35,689 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 18:42:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:42:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 18:42:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 18:42:35,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:35,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:35,697 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:35,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-11-07 18:42:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:35,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:35,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:35,937 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:42:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 18:42:35,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:35,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:35,981 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-07 18:42:35,984 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:36,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:36,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:36,878 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:42:36,882 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 18:42:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:36,915 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:42:37,417 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 79.53% of their original sizes. [2018-11-07 18:42:37,418 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:42:38,663 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-07 18:42:38,663 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:42:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:38,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-07 18:42:38,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:38,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:42:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:42:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:42:38,669 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-11-07 18:42:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:50,092 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-11-07 18:42:50,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:42:50,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-11-07 18:42:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:50,102 INFO L225 Difference]: With dead ends: 3911 [2018-11-07 18:42:50,102 INFO L226 Difference]: Without dead ends: 1989 [2018-11-07 18:42:50,109 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:42:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-11-07 18:42:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-11-07 18:42:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-11-07 18:42:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-11-07 18:42:50,163 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 148 [2018-11-07 18:42:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:50,164 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-11-07 18:42:50,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:42:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-11-07 18:42:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-07 18:42:50,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:50,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:50,172 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:50,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-11-07 18:42:50,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:50,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:50,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:50,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:50,597 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-07 18:42:50,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:50,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:50,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-11-07 18:42:50,598 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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:50,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:50,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:51,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:42:51,040 INFO L272 AbstractInterpreter]: Visited 125 different actions 191 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:42:51,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:51,079 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:42:51,599 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 81.43% of their original sizes. [2018-11-07 18:42:51,600 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:42:52,906 INFO L415 sIntCurrentIteration]: We unified 156 AI predicates to 156 [2018-11-07 18:42:52,907 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:42:52,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:52,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 18:42:52,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:52,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 18:42:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 18:42:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 18:42:52,909 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 19 states. [2018-11-07 18:43:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:06,248 INFO L93 Difference]: Finished difference Result 4196 states and 5533 transitions. [2018-11-07 18:43:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:43:06,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 157 [2018-11-07 18:43:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:06,262 INFO L225 Difference]: With dead ends: 4196 [2018-11-07 18:43:06,262 INFO L226 Difference]: Without dead ends: 2274 [2018-11-07 18:43:06,269 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:43:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2018-11-07 18:43:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2263. [2018-11-07 18:43:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-11-07 18:43:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2914 transitions. [2018-11-07 18:43:06,333 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2914 transitions. Word has length 157 [2018-11-07 18:43:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:06,333 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 2914 transitions. [2018-11-07 18:43:06,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 18:43:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2914 transitions. [2018-11-07 18:43:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 18:43:06,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:06,346 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, 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] [2018-11-07 18:43:06,346 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:06,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash 949105357, now seen corresponding path program 1 times [2018-11-07 18:43:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:06,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:06,523 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:06,523 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-07 18:43:06,523 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [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], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:43:06,528 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:06,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:06,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:43:06,895 INFO L272 AbstractInterpreter]: Visited 125 different actions 191 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:43:06,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:06,903 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:43:07,823 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 81.16% of their original sizes. [2018-11-07 18:43:07,824 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:43:09,129 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-07 18:43:09,129 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:43:09,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:43:09,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-07 18:43:09,130 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 18:43:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 18:43:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-11-07 18:43:09,135 INFO L87 Difference]: Start difference. First operand 2263 states and 2914 transitions. Second operand 23 states. [2018-11-07 18:43:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:24,606 INFO L93 Difference]: Finished difference Result 4605 states and 5974 transitions. [2018-11-07 18:43:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 18:43:24,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 190 [2018-11-07 18:43:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:24,617 INFO L225 Difference]: With dead ends: 4605 [2018-11-07 18:43:24,617 INFO L226 Difference]: Without dead ends: 2683 [2018-11-07 18:43:24,624 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 162 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 18:43:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-11-07 18:43:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2401. [2018-11-07 18:43:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-11-07 18:43:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3057 transitions. [2018-11-07 18:43:24,688 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3057 transitions. Word has length 190 [2018-11-07 18:43:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:24,689 INFO L480 AbstractCegarLoop]: Abstraction has 2401 states and 3057 transitions. [2018-11-07 18:43:24,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 18:43:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3057 transitions. [2018-11-07 18:43:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 18:43:24,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:24,698 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 18:43:24,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:24,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1559476336, now seen corresponding path program 1 times [2018-11-07 18:43:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:24,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:24,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:24,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 18:43:24,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:24,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:24,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-11-07 18:43:24,990 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], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:43:24,995 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:24,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:25,806 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:43:25,807 INFO L272 AbstractInterpreter]: Visited 126 different actions 447 times. Merged at 8 different actions 29 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:43:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:25,815 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:43:26,198 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 80.39% of their original sizes. [2018-11-07 18:43:26,199 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:43:26,288 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-11-07 18:43:26,289 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:43:26,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:43:26,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 18:43:26,289 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:26,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 18:43:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 18:43:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:43:26,290 INFO L87 Difference]: Start difference. First operand 2401 states and 3057 transitions. Second operand 10 states. [2018-11-07 18:43:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:30,527 INFO L93 Difference]: Finished difference Result 5171 states and 6707 transitions. [2018-11-07 18:43:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 18:43:30,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-11-07 18:43:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:30,540 INFO L225 Difference]: With dead ends: 5171 [2018-11-07 18:43:30,540 INFO L226 Difference]: Without dead ends: 3249 [2018-11-07 18:43:30,546 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 190 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-07 18:43:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2018-11-07 18:43:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3234. [2018-11-07 18:43:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2018-11-07 18:43:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4070 transitions. [2018-11-07 18:43:30,630 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4070 transitions. Word has length 199 [2018-11-07 18:43:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:30,631 INFO L480 AbstractCegarLoop]: Abstraction has 3234 states and 4070 transitions. [2018-11-07 18:43:30,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 18:43:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4070 transitions. [2018-11-07 18:43:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-07 18:43:30,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:30,643 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:43:30,643 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:30,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:30,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1041225973, now seen corresponding path program 1 times [2018-11-07 18:43:30,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:30,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:30,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:30,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:43:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:31,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:31,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-07 18:43:31,161 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:43:31,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:31,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:33,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:43:33,820 INFO L272 AbstractInterpreter]: Visited 128 different actions 1109 times. Merged at 9 different actions 103 times. Widened at 1 different actions 5 times. Found 23 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:43:33,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:33,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:43:33,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:33,833 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:43:33,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:33,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:43:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:33,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:43:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 18:43:34,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:43:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Abandoning pump threads because process wont die! [2018-11-07 18:43:35,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:43:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:43:35,111 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:43:35,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:43:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:43:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:43:35,114 INFO L87 Difference]: Start difference. First operand 3234 states and 4070 transitions. Second operand 11 states. [2018-11-07 18:43:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:39,862 INFO L93 Difference]: Finished difference Result 11640 states and 15437 transitions. [2018-11-07 18:43:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 18:43:39,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-11-07 18:43:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:39,903 INFO L225 Difference]: With dead ends: 11640 [2018-11-07 18:43:39,903 INFO L226 Difference]: Without dead ends: 8611 [2018-11-07 18:43:39,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:43:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2018-11-07 18:43:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8402. [2018-11-07 18:43:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8402 states. [2018-11-07 18:43:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8402 states to 8402 states and 10522 transitions. [2018-11-07 18:43:40,179 INFO L78 Accepts]: Start accepts. Automaton has 8402 states and 10522 transitions. Word has length 207 [2018-11-07 18:43:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:40,180 INFO L480 AbstractCegarLoop]: Abstraction has 8402 states and 10522 transitions. [2018-11-07 18:43:40,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:43:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8402 states and 10522 transitions. [2018-11-07 18:43:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 18:43:40,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:40,202 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:43:40,202 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:40,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash 69921341, now seen corresponding path program 1 times [2018-11-07 18:43:40,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:40,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:40,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:40,744 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:43:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:43:40,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:40,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:40,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-07 18:43:40,940 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:43:40,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:40,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:41,887 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:43:41,887 INFO L272 AbstractInterpreter]: Visited 127 different actions 320 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:43:41,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:41,930 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:43:42,426 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 80.41% of their original sizes. [2018-11-07 18:43:42,426 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:43:43,361 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-07 18:43:43,361 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:43:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:43:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:43:43,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:43,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:43:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:43:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:43:43,363 INFO L87 Difference]: Start difference. First operand 8402 states and 10522 transitions. Second operand 11 states. [2018-11-07 18:43:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:51,124 INFO L93 Difference]: Finished difference Result 16324 states and 20557 transitions. [2018-11-07 18:43:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 18:43:51,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2018-11-07 18:43:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:51,164 INFO L225 Difference]: With dead ends: 16324 [2018-11-07 18:43:51,164 INFO L226 Difference]: Without dead ends: 8683 [2018-11-07 18:43:51,185 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:43:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8683 states. [2018-11-07 18:43:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8683 to 8678. [2018-11-07 18:43:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8678 states. [2018-11-07 18:43:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 10818 transitions. [2018-11-07 18:43:51,402 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 10818 transitions. Word has length 216 [2018-11-07 18:43:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:51,403 INFO L480 AbstractCegarLoop]: Abstraction has 8678 states and 10818 transitions. [2018-11-07 18:43:51,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:43:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 10818 transitions. [2018-11-07 18:43:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-07 18:43:51,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:51,430 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 18:43:51,430 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:51,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -969326417, now seen corresponding path program 1 times [2018-11-07 18:43:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:51,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:51,974 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:43:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 18:43:52,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:52,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:52,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-11-07 18:43:52,186 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:43:52,188 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:52,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:55,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:43:55,302 INFO L272 AbstractInterpreter]: Visited 128 different actions 1359 times. Merged at 9 different actions 117 times. Widened at 1 different actions 7 times. Found 28 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:43:55,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:55,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:43:55,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:55,311 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 18:43:55,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:55,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:43:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:55,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:43:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:43:55,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:43:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:43:55,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:43:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-07 18:43:55,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:43:55,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 18:43:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 18:43:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:43:55,983 INFO L87 Difference]: Start difference. First operand 8678 states and 10818 transitions. Second operand 8 states. [2018-11-07 18:43:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:59,644 INFO L93 Difference]: Finished difference Result 17475 states and 22419 transitions. [2018-11-07 18:43:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 18:43:59,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2018-11-07 18:43:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:59,678 INFO L225 Difference]: With dead ends: 17475 [2018-11-07 18:43:59,679 INFO L226 Difference]: Without dead ends: 9834 [2018-11-07 18:43:59,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-07 18:43:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2018-11-07 18:43:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9194. [2018-11-07 18:43:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9194 states. [2018-11-07 18:43:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9194 states to 9194 states and 11049 transitions. [2018-11-07 18:43:59,932 INFO L78 Accepts]: Start accepts. Automaton has 9194 states and 11049 transitions. Word has length 232 [2018-11-07 18:43:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:59,933 INFO L480 AbstractCegarLoop]: Abstraction has 9194 states and 11049 transitions. [2018-11-07 18:43:59,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 18:43:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9194 states and 11049 transitions. [2018-11-07 18:43:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 18:43:59,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:59,960 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:43:59,960 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:59,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1797507141, now seen corresponding path program 1 times [2018-11-07 18:43:59,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:59,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:59,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 174 proven. 52 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-07 18:44:00,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:00,757 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:00,757 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-07 18:44:00,757 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:44:00,760 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:00,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:01,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:01,882 INFO L272 AbstractInterpreter]: Visited 128 different actions 587 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:44:01,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:01,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:01,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:01,922 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 18:44:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:02,034 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:02,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 18:44:02,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 18:44:02,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-11-07 18:44:02,614 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:02,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:44:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:44:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:44:02,615 INFO L87 Difference]: Start difference. First operand 9194 states and 11049 transitions. Second operand 12 states. [2018-11-07 18:44:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:06,948 INFO L93 Difference]: Finished difference Result 17821 states and 23031 transitions. [2018-11-07 18:44:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 18:44:06,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-11-07 18:44:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:06,991 INFO L225 Difference]: With dead ends: 17821 [2018-11-07 18:44:06,991 INFO L226 Difference]: Without dead ends: 9521 [2018-11-07 18:44:07,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 18:44:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2018-11-07 18:44:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 8710. [2018-11-07 18:44:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8710 states. [2018-11-07 18:44:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 10027 transitions. [2018-11-07 18:44:07,279 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 10027 transitions. Word has length 242 [2018-11-07 18:44:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:07,279 INFO L480 AbstractCegarLoop]: Abstraction has 8710 states and 10027 transitions. [2018-11-07 18:44:07,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:44:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 10027 transitions. [2018-11-07 18:44:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 18:44:07,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:07,305 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 18:44:07,305 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:07,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156005, now seen corresponding path program 1 times [2018-11-07 18:44:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:07,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:08,262 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:44:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 181 proven. 45 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 18:44:08,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:08,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:08,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-07 18:44:08,362 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:44:08,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:08,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:09,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:09,754 INFO L272 AbstractInterpreter]: Visited 128 different actions 709 times. Merged at 9 different actions 53 times. Widened at 1 different actions 1 times. Found 14 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:44:09,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:09,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:09,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:09,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:09,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:09,771 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:09,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-07 18:44:10,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-07 18:44:10,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 18:44:10,332 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:44:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:44:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 18:44:10,333 INFO L87 Difference]: Start difference. First operand 8710 states and 10027 transitions. Second operand 12 states. [2018-11-07 18:44:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:14,631 INFO L93 Difference]: Finished difference Result 17321 states and 20607 transitions. [2018-11-07 18:44:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 18:44:14,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 263 [2018-11-07 18:44:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:14,651 INFO L225 Difference]: With dead ends: 17321 [2018-11-07 18:44:14,652 INFO L226 Difference]: Without dead ends: 7608 [2018-11-07 18:44:14,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 18:44:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2018-11-07 18:44:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 5922. [2018-11-07 18:44:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5922 states. [2018-11-07 18:44:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 6526 transitions. [2018-11-07 18:44:14,801 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 6526 transitions. Word has length 263 [2018-11-07 18:44:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:14,802 INFO L480 AbstractCegarLoop]: Abstraction has 5922 states and 6526 transitions. [2018-11-07 18:44:14,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:44:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 6526 transitions. [2018-11-07 18:44:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-07 18:44:14,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:14,818 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:44:14,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:14,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash -317338975, now seen corresponding path program 1 times [2018-11-07 18:44:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:14,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:14,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:14,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:14,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 246 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 18:44:15,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:15,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:15,235 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-11-07 18:44:15,235 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [77], [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], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:44:15,237 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:15,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:17,593 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:17,593 INFO L272 AbstractInterpreter]: Visited 130 different actions 1018 times. Merged at 11 different actions 111 times. Widened at 1 different actions 4 times. Found 31 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:44:17,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:17,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:17,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:17,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:17,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:17,611 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:17,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-07 18:44:17,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-07 18:44:18,615 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:44:18,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 18:44:18,615 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:44:18,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:44:18,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:44:18,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:44:18,617 INFO L87 Difference]: Start difference. First operand 5922 states and 6526 transitions. Second operand 3 states. [2018-11-07 18:44:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:19,062 INFO L93 Difference]: Finished difference Result 10941 states and 12111 transitions. [2018-11-07 18:44:19,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:44:19,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-07 18:44:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:19,073 INFO L225 Difference]: With dead ends: 10941 [2018-11-07 18:44:19,073 INFO L226 Difference]: Without dead ends: 5922 [2018-11-07 18:44:19,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:44:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2018-11-07 18:44:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 5648. [2018-11-07 18:44:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5648 states. [2018-11-07 18:44:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5648 states to 5648 states and 6204 transitions. [2018-11-07 18:44:19,190 INFO L78 Accepts]: Start accepts. Automaton has 5648 states and 6204 transitions. Word has length 278 [2018-11-07 18:44:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:19,191 INFO L480 AbstractCegarLoop]: Abstraction has 5648 states and 6204 transitions. [2018-11-07 18:44:19,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:44:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 5648 states and 6204 transitions. [2018-11-07 18:44:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-07 18:44:19,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:19,202 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:44:19,202 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:19,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash -757481712, now seen corresponding path program 1 times [2018-11-07 18:44:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:19,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:19,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 18:44:19,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:19,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:19,592 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-11-07 18:44:19,593 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:44:19,595 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:19,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:20,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:20,546 INFO L272 AbstractInterpreter]: Visited 129 different actions 461 times. Merged at 9 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:44:20,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:20,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:20,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:20,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:20,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:20,566 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:20,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 18:44:20,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-07 18:44:20,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:20,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 18:44:20,910 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:20,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:44:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:44:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:44:20,911 INFO L87 Difference]: Start difference. First operand 5648 states and 6204 transitions. Second operand 9 states. [2018-11-07 18:44:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:21,804 INFO L93 Difference]: Finished difference Result 9294 states and 10325 transitions. [2018-11-07 18:44:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 18:44:21,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-11-07 18:44:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:21,805 INFO L225 Difference]: With dead ends: 9294 [2018-11-07 18:44:21,805 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:44:21,817 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:44:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:44:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:44:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:44:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:44:21,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2018-11-07 18:44:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:21,818 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:44:21,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:44:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:44:21,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:44:21,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:44:22,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:22,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,348 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 550 DAG size of output: 409 [2018-11-07 18:44:23,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:23,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:44:24,305 WARN L179 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 544 DAG size of output: 428 [2018-11-07 18:44:24,548 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-07 18:44:25,005 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 86 [2018-11-07 18:44:29,216 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 359 DAG size of output: 170 [2018-11-07 18:44:31,798 WARN L179 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 416 DAG size of output: 142 [2018-11-07 18:44:34,973 WARN L179 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 437 DAG size of output: 145 [2018-11-07 18:44:34,977 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:44:34,977 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-11-07 18:44:34,977 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:44:34,977 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:44:34,977 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:44:34,978 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,979 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:44:34,980 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:44:34,981 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,982 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:44:34,983 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,984 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,985 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:44:34,986 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:44:34,987 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:44:34,988 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:44:34,989 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:44:34,990 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse17 (= 1 ~a21~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse27 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse28 (<= |old(~a8~0)| ~a8~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse11 (= 1 |old(~a17~0)|)) (.cse19 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse19)) (.cse18 (not (= 13 |old(~a8~0)|))) (.cse9 (not .cse11)) (.cse20 (< |old(~a20~0)| 1)) (.cse14 (< 0 |old(~a21~0)|)) (.cse13 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse27 .cse5 .cse7 .cse28 .cse8)) (.cse32 (< |old(~a8~0)| 15)) (.cse30 (< |old(~a8~0)| 14)) (.cse31 (and .cse4 .cse27 .cse5 .cse7 .cse28 .cse17 .cse8)) (.cse16 (not (= 1 |old(~a21~0)|))) (.cse23 (< 1 |old(~a17~0)|)) (.cse33 (= 1 ~a20~0)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse24 (not (= 15 |old(~a8~0)|))) (.cse25 (< |old(~a17~0)| 0)) (.cse29 (= 6 |old(~a16~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse10 (and .cse4 .cse27 .cse5 .cse6 .cse7 .cse8)) (.cse3 (not (= 8 ~a12~0))) (.cse12 (< 14 |old(~a8~0)|)) (.cse15 (< 0 |old(~a20~0)|)) (.cse26 (< |calculate_output_#in~input| 1)) (.cse22 (not (= 0 |old(~a7~0)|))) (.cse21 (< 6 |calculate_output_#in~input|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse0 .cse1 .cse10 .cse3 .cse11 .cse12) (or .cse13 (< 4 |old(~a16~0)|) .cse3 .cse12 .cse14 .cse15) (or .cse0 .cse10 .cse2 .cse3 .cse11 .cse12 .cse15) (or .cse16 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) .cse17) .cse18 .cse9) (or .cse0 .cse19 .cse1 .cse10 .cse3 .cse12) (or .cse0 .cse19 .cse3 .cse20 .cse11 .cse12 .cse10) (or (or .cse21 .cse22 .cse16 .cse3 .cse23 (< |old(~a20~0)| 0) .cse24 .cse25 .cse15 .cse26) (and .cse4 .cse27 .cse17 (<= ~a20~0 0) (<= 0 ~a20~0) .cse5 .cse7 .cse28)) (or .cse29 .cse16 .cse19 .cse30 .cse31 .cse3 .cse11 .cse12) (or .cse16 .cse31 (or .cse0 .cse19 .cse1 .cse3 .cse11) .cse32) (or .cse16 .cse1 .cse2 (and (= 1 ~a7~0) .cse33 .cse4 (= 1 ~a17~0)) .cse3 (not .cse0) .cse18 .cse9) (or .cse19 .cse3 .cse20 .cse11 .cse12 .cse14 .cse13) (or (or .cse29 .cse1 .cse3 .cse14) .cse13 .cse12) (or .cse29 .cse16 .cse0 .cse3 .cse31 .cse32 .cse15) (or .cse29 .cse16 .cse30 .cse31 .cse3 .cse11 .cse15) (or .cse21 .cse22 .cse16 .cse3 .cse23 (and .cse4 .cse27 .cse17 .cse33 .cse5 .cse7 .cse28) .cse1 .cse24 .cse25 .cse11 .cse26) (or .cse29 .cse0 .cse19 .cse10 .cse3 .cse12 .cse15) (or (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= ~a16~0 5) (= ~a8~0 15) .cse17 (= ~a7~0 0) .cse5 (= ~a20~0 1)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse26 .cse22 .cse21 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))))) [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,991 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:44:34,992 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,993 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:44:34,994 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:44:34,995 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:44:34,996 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:44:34,997 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:44:34,997 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) (= ~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) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 18:44:34,998 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:44:34,998 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:44:34,998 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)) (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)) (and (= ~a16~0 5) (= ~a8~0 15) (= 1 ~a21~0) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1))) [2018-11-07 18:44:34,998 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:44:34,998 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse1 (not (= ~a16~0 6))) (.cse16 (= |old(~a20~0)| ~a20~0)) (.cse13 (= 4 ~a16~0)) (.cse14 (= 1 ~a17~0)) (.cse11 (= ~a21~0 1)) (.cse15 (<= 15 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse6 (<= ~a21~0 0)) (.cse17 (<= 0 ~a17~0)) (.cse9 (<= 1 main_~input~0)) (.cse18 (<= ~a17~0 1)) (.cse19 (<= ~a8~0 |old(~a8~0)|)) (.cse2 (= 1 ~a21~0)) (.cse12 (= 1 ~a20~0)) (.cse10 (<= main_~input~0 6)) (.cse20 (= ~a7~0 |old(~a7~0)|)) (.cse8 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse21 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and (and (and .cse8 .cse1 .cse5) .cse7) .cse4) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and .cse9 .cse10 (and (= ~a8~0 15) (= (+ main_~output~0 1) 0) .cse11 (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5))) (and .cse12 (= 13 ~a8~0) .cse13 .cse2 .cse14) (and (and (and .cse8 .cse3 .cse5) .cse12) .cse2) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and (and (and .cse8 .cse1 .cse7) .cse15) .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and (and .cse8 .cse13 .cse3 .cse7) .cse4) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (and .cse6 .cse16 .cse1) .cse4) (and .cse8 .cse16 .cse4) (and .cse8 .cse16 .cse13 .cse14) (and .cse17 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse15 (<= 0 ~a20~0) .cse7) (not (= ~z~0 26)) (and .cse6 .cse3 .cse4 .cse21 .cse5) (and .cse17 .cse9 .cse3 .cse18 .cse19 .cse2 .cse12 .cse10 .cse20) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and (and .cse8 .cse3 .cse5 .cse21) .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 18:44:34,999 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:44:34,999 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:44:34,999 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:44:34,999 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= 14 ~a8~0)) (.cse17 (<= 15 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse13 (= ~a21~0 1)) (.cse1 (not (= ~a16~0 6))) (.cse18 (= |old(~a20~0)| ~a20~0)) (.cse10 (= 4 ~a16~0)) (.cse11 (= 1 ~a17~0)) (.cse6 (<= ~a21~0 0)) (.cse12 (<= 0 ~a17~0)) (.cse14 (<= ~a17~0 1)) (.cse15 (<= ~a8~0 |old(~a8~0)|)) (.cse2 (= 1 ~a21~0)) (.cse9 (= 1 ~a20~0)) (.cse16 (= ~a7~0 |old(~a7~0)|)) (.cse8 (not (= ~a7~0 1))) (.cse3 (not (= ~a17~0 1))) (.cse5 (not (= ~a16~0 4))) (.cse19 (<= 1 ~a20~0)) (.cse4 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 (<= ~a16~0 4)) (and (and (and .cse8 .cse1 .cse5) .cse7) .cse4) (and (and .cse1 .cse3 .cse7) .cse0 .cse2) (and .cse9 (= 13 ~a8~0) .cse10 .cse2 .cse11) (and (and (and .cse8 .cse3 .cse5) .cse9) .cse2) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 0 ~a20~0) .cse7) (and (and (and .cse8 .cse1 .cse7) .cse17) .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and (and .cse8 .cse10 .cse3 .cse7) .cse4) (not (= ~e~0 5)) (not (= 21 ~u~0)) (and .cse15 (and (= (+ main_~output~0 1) 0) .cse13 (= ~a16~0 5)) .cse9 .cse16) (not (= 22 ~v~0)) (and (and .cse6 .cse18 .cse1) .cse4) (and .cse8 .cse18 .cse4) (and .cse8 .cse18 .cse10 .cse11) (not (= ~z~0 26)) (and .cse6 .cse3 .cse4 .cse19 .cse5) (and .cse12 (<= 1 main_~input~0) .cse3 .cse14 .cse15 .cse2 .cse9 (<= main_~input~0 6) .cse16) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and (and .cse8 .cse3 .cse5 .cse19) .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 18:44:34,999 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:44:35,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:44:35 BoogieIcfgContainer [2018-11-07 18:44:35,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:44:35,018 INFO L168 Benchmark]: Toolchain (without parser) took 136818.16 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -240.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 18:44:35,019 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:44:35,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:44:35,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 18:44:35,021 INFO L168 Benchmark]: Boogie Preprocessor took 122.54 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:44:35,021 INFO L168 Benchmark]: RCFGBuilder took 3377.29 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-11-07 18:44:35,022 INFO L168 Benchmark]: TraceAbstraction took 132460.51 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 1.7 GB in the end (delta: 422.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 18:44:35,027 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.28 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 719.09 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 133.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.54 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3377.29 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: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132460.51 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 1.7 GB in the end (delta: 422.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: 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: ((((((((((((((((((((((((((((((((((((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4)) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || !(3 == c)) || !(1 == \old(a21))) || !(4 == d)) || !(2 == b)) || !(y == 25)) || (((((((0 <= a17 && a21 == 1) && a17 <= 1) && a8 <= \old(a8)) && a7 == \old(a7)) && 15 <= a8) && 0 <= a20) && a20 <= 0)) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || !(x == 24)) || !(a12 == 8)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || !(e == 5)) || !(21 == u)) || (((a8 <= \old(a8) && (output + 1 == 0 && a21 == 1) && a16 == 5) && 1 == a20) && a7 == \old(a7))) || !(22 == v)) || (((a21 <= 0 && \old(a20) == a20) && !(a16 == 6)) && a8 <= 14)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || !(z == 26)) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || ((((((((0 <= a17 && 1 <= input) && !(a17 == 1)) && a17 <= 1) && a8 <= \old(a8)) && 1 == a21) && 1 == a20) && input <= 6) && a7 == \old(a7))) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 132.3s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 80.8s AutomataDifference, 0.0s DeadEndRemovalTime, 13.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2160 SDtfs, 16422 SDslu, 2909 SDs, 0 SdLazy, 20392 SolverSat, 3121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.4s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4217 GetRequests, 3905 SyntacticMatches, 28 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9194occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.3s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9975050741403713 AbsIntWeakeningRatio, 0.20662983425414364 AbsIntAvgWeakeningVarsNumRemoved, 23.78232044198895 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 3981 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 411 PreInvPairs, 543 NumberOfFragments, 1811 HoareAnnotationTreeSize, 411 FomulaSimplifications, 73631 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 65376 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 4715 NumberOfCodeBlocks, 4715 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6189 ConstructedInterpolants, 0 QuantifiedInterpolants, 3158235 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3964 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5323/5694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...