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_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:40:50,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:40:50,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:40:50,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:40:50,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:40:50,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:40:50,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:40:50,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:40:50,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:40:50,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:40:50,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:40:50,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:40:50,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:40:50,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:40:50,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:40:50,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:40:50,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:40:50,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:40:50,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:40:50,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:40:50,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:40:50,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:40:50,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:40:50,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:40:50,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:40:50,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:40:50,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:40:50,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:40:50,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:40:50,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:40:50,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:40:50,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:40:50,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:40:50,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:40:50,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:40:50,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:40:50,440 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:40:50,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:40:50,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:40:50,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:40:50,468 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:40:50,468 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:40:50,468 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:40:50,468 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:40:50,469 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:40:50,469 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:40:50,469 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:40:50,469 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:40:50,469 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:40:50,470 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:40:50,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:40:50,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:40:50,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:40:50,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:40:50,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:40:50,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:40:50,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:40:50,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:40:50,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:40:50,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:40:50,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:40:50,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:40:50,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:50,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:40:50,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:40:50,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:40:50,473 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:40:50,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:40:50,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:40:50,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:40:50,474 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:40:50,474 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:40:50,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:40:50,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:40:50,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:40:50,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:40:50,542 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:40:50,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 18:40:50,611 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6e1f951/3de14cb0c9b14aa584346d884917c9f6/FLAG871e91632 [2018-11-07 18:40:51,191 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:40:51,192 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 18:40:51,211 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6e1f951/3de14cb0c9b14aa584346d884917c9f6/FLAG871e91632 [2018-11-07 18:40:51,228 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6e1f951/3de14cb0c9b14aa584346d884917c9f6 [2018-11-07 18:40:51,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:40:51,244 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:40:51,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:51,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:40:51,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:40:51,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:51" (1/1) ... [2018-11-07 18:40:51,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26144291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:51, skipping insertion in model container [2018-11-07 18:40:51,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:51" (1/1) ... [2018-11-07 18:40:51,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:40:51,350 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:40:51,883 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:51,888 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:40:52,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:52,041 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:40:52,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52 WrapperNode [2018-11-07 18:40:52,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:52,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:52,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:40:52,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:40:52,054 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:40:52" (1/1) ... [2018-11-07 18:40:52,088 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:40:52" (1/1) ... [2018-11-07 18:40:52,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:52,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:40:52,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:40:52,212 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:40:52,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (1/1) ... [2018-11-07 18:40:52,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:40:52,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:40:52,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:40:52,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:40:52,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (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:40:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:40:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:40:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:40:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:40:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:40:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:40:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:40:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:40:52,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:40:55,497 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:40:55,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:55 BoogieIcfgContainer [2018-11-07 18:40:55,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:40:55,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:40:55,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:40:55,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:40:55,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:51" (1/3) ... [2018-11-07 18:40:55,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8210dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:55, skipping insertion in model container [2018-11-07 18:40:55,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:52" (2/3) ... [2018-11-07 18:40:55,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8210dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:55, skipping insertion in model container [2018-11-07 18:40:55,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:55" (3/3) ... [2018-11-07 18:40:55,507 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34_true-unreach-call_false-termination.c [2018-11-07 18:40:55,518 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:40:55,528 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:40:55,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:40:55,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:40:55,587 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:40:55,587 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:40:55,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:40:55,587 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:40:55,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:40:55,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:40:55,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:40:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:40:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-07 18:40:55,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:55,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:55,634 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1144269880, now seen corresponding path program 1 times [2018-11-07 18:40:55,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:55,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:56,391 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:40:56,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:56,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:56,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:56,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:56,420 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 18:40:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:57,766 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 18:40:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-07 18:40:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:57,786 INFO L225 Difference]: With dead ends: 550 [2018-11-07 18:40:57,786 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 18:40:57,793 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:40:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 18:40:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 18:40:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:40:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 18:40:57,910 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 112 [2018-11-07 18:40:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:57,912 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 18:40:57,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 18:40:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 18:40:57,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:57,921 INFO L375 BasicCegarLoop]: trace histogram [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:40:57,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:57,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -255516033, now seen corresponding path program 1 times [2018-11-07 18:40:57,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:57,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:57,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:40:58,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:40:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:40:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:40:58,071 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 18:40:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:59,876 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 18:40:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:59,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-11-07 18:40:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:59,885 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 18:40:59,885 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 18:40:59,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:40:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 18:40:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 18:40:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 18:40:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 18:40:59,939 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 122 [2018-11-07 18:40:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:59,940 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 18:40:59,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:40:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 18:40:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 18:40:59,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:59,946 INFO L375 BasicCegarLoop]: trace histogram [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:40:59,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:59,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -289707029, now seen corresponding path program 1 times [2018-11-07 18:40:59,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:59,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:41:00,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:41:00,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:41:00,148 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:00,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:41:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:41:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:41:00,150 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 3 states. [2018-11-07 18:41:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:01,684 INFO L93 Difference]: Finished difference Result 1919 states and 3096 transitions. [2018-11-07 18:41:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:41:01,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-07 18:41:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:01,694 INFO L225 Difference]: With dead ends: 1919 [2018-11-07 18:41:01,695 INFO L226 Difference]: Without dead ends: 1192 [2018-11-07 18:41:01,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:41:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-11-07 18:41:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2018-11-07 18:41:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-11-07 18:41:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1735 transitions. [2018-11-07 18:41:01,766 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1735 transitions. Word has length 132 [2018-11-07 18:41:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:01,767 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1735 transitions. [2018-11-07 18:41:01,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:41:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1735 transitions. [2018-11-07 18:41:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 18:41:01,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:01,774 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:01,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1523382030, now seen corresponding path program 1 times [2018-11-07 18:41:01,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:01,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:01,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:01,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:01,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:41:02,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:02,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:02,246 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2018-11-07 18:41:02,249 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [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], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:02,306 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:02,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:03,596 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:03,597 INFO L272 AbstractInterpreter]: Visited 116 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:41:03,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:03,650 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:04,307 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 80.4% of their original sizes. [2018-11-07 18:41:04,307 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:05,275 INFO L415 sIntCurrentIteration]: We unified 133 AI predicates to 133 [2018-11-07 18:41:05,275 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:05,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:05,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:41:05,276 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:05,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:41:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:41:05,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:05,278 INFO L87 Difference]: Start difference. First operand 1192 states and 1735 transitions. Second operand 11 states. [2018-11-07 18:41:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:18,724 INFO L93 Difference]: Finished difference Result 3249 states and 4708 transitions. [2018-11-07 18:41:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 18:41:18,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-07 18:41:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:18,736 INFO L225 Difference]: With dead ends: 3249 [2018-11-07 18:41:18,736 INFO L226 Difference]: Without dead ends: 2063 [2018-11-07 18:41:18,742 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:41:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2018-11-07 18:41:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2036. [2018-11-07 18:41:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-11-07 18:41:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2679 transitions. [2018-11-07 18:41:18,802 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2679 transitions. Word has length 134 [2018-11-07 18:41:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:18,802 INFO L480 AbstractCegarLoop]: Abstraction has 2036 states and 2679 transitions. [2018-11-07 18:41:18,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:41:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2679 transitions. [2018-11-07 18:41:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 18:41:18,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:18,809 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:18,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:18,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -521176307, now seen corresponding path program 1 times [2018-11-07 18:41:18,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:18,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 18:41:18,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:18,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:18,991 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-07 18:41:18,992 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [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], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:18,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:18,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:19,409 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:19,409 INFO L272 AbstractInterpreter]: Visited 117 different actions 184 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:41:19,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:19,432 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:19,918 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 81.52% of their original sizes. [2018-11-07 18:41:19,918 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:20,513 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-07 18:41:20,513 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:20,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:41:20,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:20,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:41:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:41:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:41:20,515 INFO L87 Difference]: Start difference. First operand 2036 states and 2679 transitions. Second operand 18 states. [2018-11-07 18:41:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:33,851 INFO L93 Difference]: Finished difference Result 4351 states and 5797 transitions. [2018-11-07 18:41:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:41:33,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-11-07 18:41:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:33,863 INFO L225 Difference]: With dead ends: 4351 [2018-11-07 18:41:33,863 INFO L226 Difference]: Without dead ends: 2457 [2018-11-07 18:41:33,871 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-07 18:41:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-11-07 18:41:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2447. [2018-11-07 18:41:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2018-11-07 18:41:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3132 transitions. [2018-11-07 18:41:33,952 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3132 transitions. Word has length 147 [2018-11-07 18:41:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:33,952 INFO L480 AbstractCegarLoop]: Abstraction has 2447 states and 3132 transitions. [2018-11-07 18:41:33,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:41:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3132 transitions. [2018-11-07 18:41:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 18:41:33,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:33,961 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:33,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash 644918266, now seen corresponding path program 1 times [2018-11-07 18:41:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:33,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:33,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:33,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:33,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:41:34,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:34,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:34,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-11-07 18:41:34,181 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [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], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:34,190 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:34,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:35,370 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:35,370 INFO L272 AbstractInterpreter]: Visited 118 different actions 543 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:35,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:35,407 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:35,756 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 80.41% of their original sizes. [2018-11-07 18:41:35,757 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:35,917 INFO L415 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-11-07 18:41:35,917 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:35,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:35,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-07 18:41:35,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:35,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:41:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:41:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:35,919 INFO L87 Difference]: Start difference. First operand 2447 states and 3132 transitions. Second operand 11 states. [2018-11-07 18:41:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:44,238 INFO L93 Difference]: Finished difference Result 5151 states and 6848 transitions. [2018-11-07 18:41:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 18:41:44,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-11-07 18:41:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:44,255 INFO L225 Difference]: With dead ends: 5151 [2018-11-07 18:41:44,255 INFO L226 Difference]: Without dead ends: 3257 [2018-11-07 18:41:44,263 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:41:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2018-11-07 18:41:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3233. [2018-11-07 18:41:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2018-11-07 18:41:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4144 transitions. [2018-11-07 18:41:44,359 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4144 transitions. Word has length 159 [2018-11-07 18:41:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:44,359 INFO L480 AbstractCegarLoop]: Abstraction has 3233 states and 4144 transitions. [2018-11-07 18:41:44,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:41:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4144 transitions. [2018-11-07 18:41:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 18:41:44,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:44,370 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:44,370 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:44,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -347544491, now seen corresponding path program 1 times [2018-11-07 18:41:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:44,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 18:41:44,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:44,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:44,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-07 18:41:44,570 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [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], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:44,574 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:44,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:46,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:41:46,046 INFO L272 AbstractInterpreter]: Visited 120 different actions 676 times. Merged at 10 different actions 60 times. Widened at 1 different actions 2 times. Found 15 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:46,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:46,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:41:46,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:46,055 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:41:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:46,066 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:41:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:46,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:41:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 18:41:46,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:41:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 78 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-07 18:41:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:41:46,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 18:41:46,787 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:41:46,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 18:41:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 18:41:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:46,789 INFO L87 Difference]: Start difference. First operand 3233 states and 4144 transitions. Second operand 8 states. [2018-11-07 18:41:47,143 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:41:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:52,838 INFO L93 Difference]: Finished difference Result 10020 states and 14133 transitions. [2018-11-07 18:41:52,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 18:41:52,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2018-11-07 18:41:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:52,884 INFO L225 Difference]: With dead ends: 10020 [2018-11-07 18:41:52,884 INFO L226 Difference]: Without dead ends: 5607 [2018-11-07 18:41:52,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 18:41:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5607 states. [2018-11-07 18:41:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5607 to 5428. [2018-11-07 18:41:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2018-11-07 18:41:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 6492 transitions. [2018-11-07 18:41:53,105 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 6492 transitions. Word has length 183 [2018-11-07 18:41:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:53,105 INFO L480 AbstractCegarLoop]: Abstraction has 5428 states and 6492 transitions. [2018-11-07 18:41:53,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 18:41:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 6492 transitions. [2018-11-07 18:41:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-07 18:41:53,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:53,121 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:53,122 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:53,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1609563388, now seen corresponding path program 1 times [2018-11-07 18:41:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:53,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:53,667 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:41:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 104 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 18:41:53,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:53,862 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:53,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-07 18:41:53,863 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:53,868 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:53,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:54,727 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:54,727 INFO L272 AbstractInterpreter]: Visited 118 different actions 186 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:41:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:54,765 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:55,764 INFO L227 lantSequenceWeakener]: Weakened 89 states. On average, predicates are now at 80.96% of their original sizes. [2018-11-07 18:41:55,764 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:56,897 INFO L415 sIntCurrentIteration]: We unified 203 AI predicates to 203 [2018-11-07 18:41:56,898 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:56,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:56,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 18:41:56,898 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:56,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 18:41:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 18:41:56,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:41:56,900 INFO L87 Difference]: Start difference. First operand 5428 states and 6492 transitions. Second operand 22 states. [2018-11-07 18:42:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:19,093 INFO L93 Difference]: Finished difference Result 10726 states and 12894 transitions. [2018-11-07 18:42:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 18:42:19,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 204 [2018-11-07 18:42:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:19,126 INFO L225 Difference]: With dead ends: 10726 [2018-11-07 18:42:19,126 INFO L226 Difference]: Without dead ends: 5851 [2018-11-07 18:42:19,140 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:42:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5851 states. [2018-11-07 18:42:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5851 to 5704. [2018-11-07 18:42:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-11-07 18:42:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6786 transitions. [2018-11-07 18:42:19,290 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6786 transitions. Word has length 204 [2018-11-07 18:42:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:19,290 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 6786 transitions. [2018-11-07 18:42:19,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 18:42:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6786 transitions. [2018-11-07 18:42:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 18:42:19,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:19,306 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 18:42:19,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:19,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash -75929249, now seen corresponding path program 1 times [2018-11-07 18:42:19,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:19,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:19,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 102 proven. 53 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-07 18:42:19,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:19,576 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:19,577 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-07 18:42:19,577 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [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], [533], [535], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:19,580 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:19,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:20,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:42:20,712 INFO L272 AbstractInterpreter]: Visited 120 different actions 563 times. Merged at 10 different actions 54 times. Widened at 1 different actions 1 times. Found 13 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:42:20,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:20,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:42:20,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:20,718 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:42:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:20,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:42:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:20,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:42:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-07 18:42:20,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:42:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 108 proven. 43 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 18:42:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:42:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:42:21,121 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:42:21,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:42:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:42:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:42:21,122 INFO L87 Difference]: Start difference. First operand 5704 states and 6786 transitions. Second operand 11 states. [2018-11-07 18:42:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:22,965 INFO L93 Difference]: Finished difference Result 12238 states and 14733 transitions. [2018-11-07 18:42:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:42:22,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2018-11-07 18:42:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:23,001 INFO L225 Difference]: With dead ends: 12238 [2018-11-07 18:42:23,002 INFO L226 Difference]: Without dead ends: 7087 [2018-11-07 18:42:23,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 427 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:42:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7087 states. [2018-11-07 18:42:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7087 to 6472. [2018-11-07 18:42:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2018-11-07 18:42:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 7663 transitions. [2018-11-07 18:42:23,202 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 7663 transitions. Word has length 213 [2018-11-07 18:42:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:23,203 INFO L480 AbstractCegarLoop]: Abstraction has 6472 states and 7663 transitions. [2018-11-07 18:42:23,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 7663 transitions. [2018-11-07 18:42:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 18:42:23,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:23,221 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 18:42:23,221 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:23,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 343190929, now seen corresponding path program 2 times [2018-11-07 18:42:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:23,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 102 proven. 55 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-07 18:42:23,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:23,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:23,691 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 18:42:23,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 18:42:23,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:23,692 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:42:23,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 18:42:23,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 18:42:23,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 18:42:23,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 18:42:23,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:42:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-07 18:42:23,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:42:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-07 18:42:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:24,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 18:42:24,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:24,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:42:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:42:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:42:24,149 INFO L87 Difference]: Start difference. First operand 6472 states and 7663 transitions. Second operand 3 states. [2018-11-07 18:42:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:24,711 INFO L93 Difference]: Finished difference Result 10422 states and 12371 transitions. [2018-11-07 18:42:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:42:24,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-11-07 18:42:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:24,721 INFO L225 Difference]: With dead ends: 10422 [2018-11-07 18:42:24,721 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:42:24,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 425 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:42:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:42:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:42:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:42:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:42:24,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2018-11-07 18:42:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:24,748 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:42:24,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:42:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:42:24,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:42:24,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:42:25,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,603 WARN L179 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 215 [2018-11-07 18:42:25,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:25,935 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 202 [2018-11-07 18:42:26,306 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-07 18:42:26,621 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2018-11-07 18:42:33,355 WARN L179 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 350 DAG size of output: 156 [2018-11-07 18:42:34,251 WARN L179 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 99 [2018-11-07 18:42:35,013 WARN L179 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 99 [2018-11-07 18:42:35,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:42:35,017 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0)) [2018-11-07 18:42:35,017 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:42:35,017 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:42:35,017 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:42:35,018 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,019 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:42:35,020 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,021 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:42:35,022 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:42:35,023 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 491) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:42:35,024 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:42:35,025 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:42:35,026 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,027 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,028 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:42:35,029 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:42:35,030 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:42:35,030 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:42:35,030 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:42:35,030 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:42:35,030 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse28 (<= 4 ~a16~0)) (.cse29 (<= ~a16~0 5)) (.cse30 (= ~a17~0 1)) (.cse31 (< |old(~a16~0)| 4)) (.cse32 (not (= 8 ~a12~0))) (.cse13 (= 1 ~a7~0)) (.cse12 (not (= ~a16~0 6))) (.cse24 (= ~a7~0 |old(~a7~0)|)) (.cse14 (= |old(~a8~0)| ~a8~0)) (.cse16 (= |old(~a20~0)| ~a20~0))) (let ((.cse9 (and .cse24 .cse14 .cse16)) (.cse1 (= 13 |old(~a8~0)|)) (.cse15 (< |old(~a8~0)| 15)) (.cse22 (and .cse13 .cse14 .cse16 .cse12)) (.cse21 (< |old(~a7~0)| 0)) (.cse26 (= ~a21~0 1)) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse27 (not (= 15 |old(~a8~0)|))) (.cse5 (< 6 |calculate_output_#in~input|)) (.cse2 (let ((.cse40 (< 15 |old(~a8~0)|)) (.cse41 (< 1 |old(~a20~0)|)) (.cse42 (< 1 |old(~a21~0)|))) (and (or .cse40 .cse32 .cse41 (< (+ |old(~a21~0)| 1) 0) .cse31 .cse42) (or .cse40 .cse32 .cse41 (< |old(~a16~0)| 3) .cse42 (< |old(~a21~0)| 0))))) (.cse17 (< |old(~a20~0)| 0)) (.cse6 (not (= 1 |old(~a17~0)|))) (.cse18 (< 5 |old(~a16~0)|)) (.cse7 (not (= 1 |old(~a7~0)|))) (.cse19 (< |old(~a8~0)| 13)) (.cse20 (and (<= 3 ~a16~0) (<= 0 (+ ~a21~0 1)) (let ((.cse33 (<= 0 ~a20~0)) (.cse34 (<= ~a7~0 1)) (.cse35 (<= 13 ~a8~0)) (.cse36 (<= ~a8~0 15)) (.cse37 (<= ~a21~0 1)) (.cse38 (<= 0 ~a7~0)) (.cse39 (<= ~a20~0 1))) (or (and .cse33 .cse34 .cse29 .cse35 .cse30 .cse28 .cse36 .cse37 .cse38 .cse39) (and .cse33 .cse34 (<= 0 ~a21~0) .cse29 .cse35 .cse30 .cse36 .cse37 .cse38 .cse39))))) (.cse4 (< |calculate_output_#in~input| 1)) (.cse8 (< 0 |old(~a7~0)|)) (.cse10 (< 0 |old(~a20~0)|)) (.cse25 (= 1 ~a20~0)) (.cse11 (= 6 |old(~a16~0)|)) (.cse23 (< 13 |old(~a8~0)|)) (.cse3 (not (= 1 |old(~a20~0)|)))) (and (or (or .cse0 (not (= 4 |old(~a16~0)|)) (not .cse1)) .cse2 .cse3 (= ~a16~0 4) .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse8 .cse9 .cse10) (or .cse9 .cse3 .cse8) (or .cse11 .cse3 .cse12 .cse8) (or .cse11 (and .cse13 .cse14 .cse12) .cse7 .cse15) (or .cse11 .cse8 .cse16 .cse10) (or .cse5 .cse1 .cse2 .cse17 .cse6 .cse18 .cse19 .cse8 .cse20 .cse21 .cse10 .cse4) (or .cse11 .cse3 .cse7 .cse22) (or .cse11 (= |old(~a7~0)| 1) .cse23 (and .cse24 .cse14 .cse12)) (or .cse3 (and .cse13 .cse14 .cse25) .cse7 .cse15) (or .cse22 .cse11 .cse7 .cse10) (or .cse23 .cse3 (and .cse13 .cse14 .cse16) .cse7) (or (and .cse26 (= ~a16~0 5)) (or .cse0 .cse2 .cse17 (not (= 5 |old(~a16~0)|)) .cse4 .cse5 .cse6 .cse27 .cse21) .cse8) (or .cse0 .cse2 (and .cse26 .cse28 .cse29 .cse30) .cse3 .cse31 .cse4 .cse5 .cse6 .cse18 (< 1 |old(~a7~0)|) .cse19 .cse21) (or (and (<= 0 ~a17~0) (<= 5 ~a16~0) .cse26 (<= ~a17~0 1) (<= ~a16~0 6)) (or (not (= 0 |old(~a7~0)|)) .cse0 .cse32 (< 1 |old(~a17~0)|) (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse3 .cse27 (< |old(~a17~0)| 0))) (or .cse5 .cse23 .cse2 .cse17 .cse6 .cse18 .cse7 .cse19 .cse20 .cse4) (or .cse11 .cse8 .cse10 .cse12) (or .cse25 .cse11 .cse23 .cse3)))) [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,031 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:42:35,032 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,033 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:42:35,034 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,035 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:42:35,036 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:42:35,037 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 18:42:35,037 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:42:35,037 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:42:35,038 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (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))) [2018-11-07 18:42:35,038 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:42:35,038 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 18:42:35,038 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:42:35,038 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:42:35,038 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:42:35,039 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a8~0 |old(~a8~0)|)) (.cse4 (<= 15 ~a8~0)) (.cse7 (<= ~a8~0 13)) (.cse0 (<= ~a20~0 0)) (.cse1 (<= ~a7~0 0)) (.cse3 (= 1 ~a7~0)) (.cse6 (= 1 ~a20~0)) (.cse5 (not (= ~a16~0 6)))) (or (and (not (= ~a8~0 13)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse2 .cse3 .cse4 .cse6) (and .cse7 (= ~a7~0 |old(~a7~0)|) .cse5) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse3 .cse6) (and .cse6 .cse1) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse3 .cse5 .cse0) (and .cse5 .cse0 .cse1) (not (= 0 |old(~a7~0)|)) (and .cse3 .cse6 .cse5) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)))) [2018-11-07 18:42:35,039 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:42:35,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:42:35 BoogieIcfgContainer [2018-11-07 18:42:35,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:42:35,054 INFO L168 Benchmark]: Toolchain (without parser) took 103812.21 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,055 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:42:35,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.75 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,057 INFO L168 Benchmark]: Boogie Preprocessor took 135.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,058 INFO L168 Benchmark]: RCFGBuilder took 3150.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 109.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,059 INFO L168 Benchmark]: TraceAbstraction took 99553.53 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.8 GB in the end (delta: -790.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 18:42:35,064 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.75 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 168.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.91 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3150.34 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 109.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99553.53 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.8 GB in the end (delta: -790.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: 491]: 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: ((((((((((((((((((((((((((((!(a8 == 13) && a20 <= 0) && a7 <= 0) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && !(a16 == 6))) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (((a8 <= \old(a8) && 1 == a7) && 15 <= a8) && 1 == a20)) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((a8 <= 13 && 1 == a7) && 1 == a20)) || (1 == a20 && a7 <= 0)) || !(z == 26)) || !(\old(a16) == 5)) || ((1 == a7 && !(a16 == 6)) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && a7 <= 0)) || !(0 == \old(a7))) || ((1 == a7 && 1 == a20) && !(a16 == 6))) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 99.4s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 70.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1293 SDtfs, 9987 SDslu, 1477 SDs, 0 SdLazy, 12721 SolverSat, 2218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1991 GetRequests, 1820 SyntacticMatches, 13 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6472occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.6s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9963276454136647 AbsIntWeakeningRatio, 0.265625 AbsIntAvgWeakeningVarsNumRemoved, 24.353125 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1014 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 209 PreInvPairs, 325 NumberOfFragments, 1436 HoareAnnotationTreeSize, 209 FomulaSimplifications, 15459 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14208 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2228 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2821 ConstructedInterpolants, 0 QuantifiedInterpolants, 954470 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1644 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 1856/2098 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...