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_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:38:40,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:38:40,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:38:40,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:38:40,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:38:40,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:38:40,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:38:40,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:38:40,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:38:40,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:38:40,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:38:40,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:38:40,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:38:40,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:38:40,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:38:40,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:38:40,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:38:40,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:38:40,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:38:40,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:38:40,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:38:40,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:38:40,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:38:40,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:38:40,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:38:40,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:38:40,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:38:40,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:38:40,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:38:40,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:38:40,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:38:40,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:38:40,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:38:40,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:38:40,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:38:40,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:38:40,485 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:38:40,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:38:40,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:38:40,517 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:38:40,517 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:38:40,517 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:38:40,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:38:40,518 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:38:40,518 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:38:40,518 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:38:40,518 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:38:40,518 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:38:40,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:38:40,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:38:40,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:38:40,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:38:40,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:38:40,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:38:40,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:38:40,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:38:40,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:38:40,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:38:40,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:38:40,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:38:40,523 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:38:40,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:38:40,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:38:40,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:38:40,524 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:38:40,524 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:38:40,525 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:38:40,525 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:38:40,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:38:40,525 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:38:40,526 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:38:40,526 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:38:40,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:38:40,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:38:40,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:38:40,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:38:40,601 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:38:40,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 18:38:40,662 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f21e772/ef0f870d3c9947b590070de14c2ce4e7/FLAGc91211610 [2018-11-07 18:38:41,238 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:38:41,238 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 18:38:41,250 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f21e772/ef0f870d3c9947b590070de14c2ce4e7/FLAGc91211610 [2018-11-07 18:38:41,266 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f21e772/ef0f870d3c9947b590070de14c2ce4e7 [2018-11-07 18:38:41,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:38:41,280 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:38:41,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:38:41,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:38:41,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:38:41,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:41,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4843e8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41, skipping insertion in model container [2018-11-07 18:38:41,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:41,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:38:41,371 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:38:41,864 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:38:41,869 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:38:41,962 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:38:41,980 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:38:41,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41 WrapperNode [2018-11-07 18:38:41,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:38:41,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:38:41,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:38:41,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:38:41,992 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:38:41" (1/1) ... [2018-11-07 18:38:42,010 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:38:41" (1/1) ... [2018-11-07 18:38:42,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:38:42,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:38:42,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:38:42,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:38:42,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... [2018-11-07 18:38:42,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:38:42,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:38:42,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:38:42,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:38:42,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:38:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:38:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:38:42,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:38:42,291 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:38:42,291 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:38:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:38:42,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:38:42,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:38:42,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:38:45,317 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:38:45,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:38:45 BoogieIcfgContainer [2018-11-07 18:38:45,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:38:45,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:38:45,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:38:45,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:38:45,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:38:41" (1/3) ... [2018-11-07 18:38:45,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240fb293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:38:45, skipping insertion in model container [2018-11-07 18:38:45,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:38:41" (2/3) ... [2018-11-07 18:38:45,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240fb293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:38:45, skipping insertion in model container [2018-11-07 18:38:45,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:38:45" (3/3) ... [2018-11-07 18:38:45,327 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 18:38:45,337 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:38:45,346 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:38:45,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:38:45,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:38:45,402 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:38:45,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:38:45,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:38:45,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:38:45,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:38:45,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:38:45,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:38:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:38:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 18:38:45,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:45,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:45,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:45,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-11-07 18:38:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:45,508 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:46,079 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:38:46,176 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:38:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:38:46,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:46,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:38:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:38:46,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:38:46,205 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 18:38:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:47,771 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 18:38:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:38:47,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-07 18:38:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:47,797 INFO L225 Difference]: With dead ends: 550 [2018-11-07 18:38:47,798 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 18:38:47,804 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:38:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 18:38:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 18:38:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:38:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 18:38:47,879 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-11-07 18:38:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:47,880 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 18:38:47,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:38:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 18:38:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 18:38:47,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:47,887 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:47,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:47,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-11-07 18:38:47,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:47,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:47,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:47,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:48,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:48,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:38:48,101 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:48,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:38:48,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:38:48,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:38:48,104 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 18:38:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:50,572 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 18:38:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:38:50,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 18:38:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:50,580 INFO L225 Difference]: With dead ends: 888 [2018-11-07 18:38:50,580 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 18:38:50,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:38:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 18:38:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 18:38:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 18:38:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 18:38:50,628 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-11-07 18:38:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:50,629 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 18:38:50,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:38:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 18:38:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 18:38:50,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:50,634 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:50,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:50,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-11-07 18:38:50,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:50,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:50,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:51,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:38:51,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:51,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:38:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:38:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:38:51,054 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 18:38:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:53,075 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 18:38:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:38:53,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-11-07 18:38:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:53,086 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 18:38:53,086 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 18:38:53,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:38:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 18:38:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 18:38:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 18:38:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 18:38:53,141 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-11-07 18:38:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:53,142 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 18:38:53,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:38:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 18:38:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 18:38:53,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:53,147 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:53,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:53,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-11-07 18:38:53,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:53,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:53,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:53,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:53,150 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:53,600 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 18:38:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:38:53,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:53,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:38:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:38:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:38:53,734 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 18:38:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:55,639 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 18:38:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:38:55,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-07 18:38:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:55,644 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 18:38:55,644 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 18:38:55,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:38:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 18:38:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 18:38:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 18:38:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 18:38:55,674 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-11-07 18:38:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:55,675 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 18:38:55,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:38:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 18:38:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 18:38:55,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:55,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:55,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-11-07 18:38:55,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:55,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:55,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:55,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:38:55,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:38:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:38:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:38:55,910 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 18:38:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:57,055 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 18:38:57,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:38:57,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-07 18:38:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:57,069 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 18:38:57,070 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 18:38:57,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:38:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 18:38:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 18:38:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 18:38:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 18:38:57,114 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-11-07 18:38:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:57,116 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 18:38:57,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:38:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 18:38:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 18:38:57,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:57,122 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:38:57,122 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:57,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-11-07 18:38:57,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:57,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:57,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:57,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:38:57,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:38:57,276 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:38:57,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:38:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:38:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:38:57,277 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 18:38:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:38:58,307 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 18:38:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:38:58,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-07 18:38:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:38:58,322 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 18:38:58,322 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 18:38:58,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:38:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 18:38:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 18:38:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 18:38:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 18:38:58,395 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-11-07 18:38:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:38:58,396 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 18:38:58,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:38:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 18:38:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 18:38:58,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:38:58,405 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:38:58,406 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:38:58,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-11-07 18:38:58,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:38:58,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:58,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:38:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:38:58,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:38:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:38:58,921 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:38:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:38:58,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:38:58,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:38:58,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 18:38:58,958 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:38:59,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:38:59,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:38:59,746 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:38:59,748 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 18:38:59,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:38:59,793 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:39:00,354 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 79.59% of their original sizes. [2018-11-07 18:39:00,355 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:39:01,638 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 18:39:01,639 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:39:01,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:39:01,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 18:39:01,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:39:01,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:39:01,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:39:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:39:01,642 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-11-07 18:39:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:39:12,231 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-11-07 18:39:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:39:12,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-11-07 18:39:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:39:12,243 INFO L225 Difference]: With dead ends: 3911 [2018-11-07 18:39:12,243 INFO L226 Difference]: Without dead ends: 1989 [2018-11-07 18:39:12,250 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:39:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-11-07 18:39:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-11-07 18:39:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-11-07 18:39:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-11-07 18:39:12,408 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-11-07 18:39:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:39:12,408 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-11-07 18:39:12,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:39:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-11-07 18:39:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 18:39:12,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:39:12,418 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:39:12,418 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:39:12,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-11-07 18:39:12,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:39:12,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:12,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:39:12,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:12,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:39:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:39:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 18:39:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:39:12,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:39:12,715 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 18:39:12,715 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:39:12,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:39:12,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:39:13,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:39:13,268 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 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:39:13,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:13,297 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:39:13,946 INFO L227 lantSequenceWeakener]: Weakened 69 states. On average, predicates are now at 81.38% of their original sizes. [2018-11-07 18:39:13,946 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:39:15,400 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 18:39:15,400 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:39:15,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:39:15,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:39:15,401 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:39:15,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:39:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:39:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:39:15,402 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 18 states. [2018-11-07 18:39:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:39:30,096 INFO L93 Difference]: Finished difference Result 4196 states and 5533 transitions. [2018-11-07 18:39:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:39:30,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 160 [2018-11-07 18:39:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:39:30,106 INFO L225 Difference]: With dead ends: 4196 [2018-11-07 18:39:30,106 INFO L226 Difference]: Without dead ends: 2274 [2018-11-07 18:39:30,113 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-11-07 18:39:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2018-11-07 18:39:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2263. [2018-11-07 18:39:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-11-07 18:39:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 2914 transitions. [2018-11-07 18:39:30,176 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 2914 transitions. Word has length 160 [2018-11-07 18:39:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:39:30,176 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 2914 transitions. [2018-11-07 18:39:30,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:39:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2914 transitions. [2018-11-07 18:39:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-07 18:39:30,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:39:30,186 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:39:30,186 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:39:30,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1610890117, now seen corresponding path program 1 times [2018-11-07 18:39:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:39:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:39:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:30,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:39:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:39:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 18:39:30,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:39:30,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:39:30,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-07 18:39:30,380 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:39:30,385 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:39:30,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:39:30,865 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:39:30,865 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 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:39:30,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:30,874 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:39:32,023 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 80.97% of their original sizes. [2018-11-07 18:39:32,024 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:39:33,510 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-07 18:39:33,511 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:39:33,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:39:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 18:39:33,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:39:33,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 18:39:33,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 18:39:33,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:39:33,513 INFO L87 Difference]: Start difference. First operand 2263 states and 2914 transitions. Second operand 22 states. [2018-11-07 18:39:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:39:54,529 INFO L93 Difference]: Finished difference Result 4605 states and 5974 transitions. [2018-11-07 18:39:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:39:54,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-11-07 18:39:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:39:54,540 INFO L225 Difference]: With dead ends: 4605 [2018-11-07 18:39:54,540 INFO L226 Difference]: Without dead ends: 2683 [2018-11-07 18:39:54,546 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 18:39:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2018-11-07 18:39:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2401. [2018-11-07 18:39:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-11-07 18:39:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3057 transitions. [2018-11-07 18:39:54,608 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3057 transitions. Word has length 193 [2018-11-07 18:39:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:39:54,608 INFO L480 AbstractCegarLoop]: Abstraction has 2401 states and 3057 transitions. [2018-11-07 18:39:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 18:39:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3057 transitions. [2018-11-07 18:39:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 18:39:54,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:39:54,618 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:39:54,618 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:39:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 281194242, now seen corresponding path program 1 times [2018-11-07 18:39:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:39:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:39:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:39:54,620 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:39:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:39:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:39:54,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:39:54,957 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:39:54,957 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-07 18:39:54,958 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:39:54,962 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:39:54,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:39:56,553 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:39:56,553 INFO L272 AbstractInterpreter]: Visited 123 different actions 569 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:39:56,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:39:56,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:39:56,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:39:56,561 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:39:56,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:39:56,571 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:39:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:39:56,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:39:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 18:39:57,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:39:57,310 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 18:39:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 18:39:57,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:39:57,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:39:57,953 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:39:57,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:39:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:39:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:39:57,954 INFO L87 Difference]: Start difference. First operand 2401 states and 3057 transitions. Second operand 11 states. [2018-11-07 18:40:01,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:01,875 INFO L93 Difference]: Finished difference Result 8864 states and 12047 transitions. [2018-11-07 18:40:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 18:40:01,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2018-11-07 18:40:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:01,906 INFO L225 Difference]: With dead ends: 8864 [2018-11-07 18:40:01,906 INFO L226 Difference]: Without dead ends: 6668 [2018-11-07 18:40:01,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:40:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2018-11-07 18:40:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6461. [2018-11-07 18:40:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6461 states. [2018-11-07 18:40:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6461 states to 6461 states and 8219 transitions. [2018-11-07 18:40:02,114 INFO L78 Accepts]: Start accepts. Automaton has 6461 states and 8219 transitions. Word has length 202 [2018-11-07 18:40:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:02,115 INFO L480 AbstractCegarLoop]: Abstraction has 6461 states and 8219 transitions. [2018-11-07 18:40:02,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:40:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6461 states and 8219 transitions. [2018-11-07 18:40:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 18:40:02,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:02,133 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:02,133 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:02,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash 425931920, now seen corresponding path program 1 times [2018-11-07 18:40:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:02,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:02,135 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:40:02,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:02,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:02,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 18:40:02,419 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:02,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:02,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:03,585 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:03,586 INFO L272 AbstractInterpreter]: Visited 122 different actions 312 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:40:03,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:03,623 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:04,134 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 80.36% of their original sizes. [2018-11-07 18:40:04,135 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:04,813 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-07 18:40:04,813 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:04,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:40:04,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:40:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:40:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:40:04,815 INFO L87 Difference]: Start difference. First operand 6461 states and 8219 transitions. Second operand 11 states. [2018-11-07 18:40:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:10,550 INFO L93 Difference]: Finished difference Result 12860 states and 16425 transitions. [2018-11-07 18:40:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 18:40:10,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2018-11-07 18:40:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:10,579 INFO L225 Difference]: With dead ends: 12860 [2018-11-07 18:40:10,579 INFO L226 Difference]: Without dead ends: 6742 [2018-11-07 18:40:10,597 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:40:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-07 18:40:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6737. [2018-11-07 18:40:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6737 states. [2018-11-07 18:40:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6737 states to 6737 states and 8515 transitions. [2018-11-07 18:40:10,768 INFO L78 Accepts]: Start accepts. Automaton has 6737 states and 8515 transitions. Word has length 211 [2018-11-07 18:40:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:10,768 INFO L480 AbstractCegarLoop]: Abstraction has 6737 states and 8515 transitions. [2018-11-07 18:40:10,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:40:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6737 states and 8515 transitions. [2018-11-07 18:40:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 18:40:10,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:10,783 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:10,783 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:10,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash 310011569, now seen corresponding path program 1 times [2018-11-07 18:40:10,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:10,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:10,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:11,320 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:40:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 18:40:11,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:11,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:11,507 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-07 18:40:11,507 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:11,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:11,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:12,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:12,012 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 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:40:12,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:12,045 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:12,557 INFO L227 lantSequenceWeakener]: Weakened 43 states. On average, predicates are now at 81.14% of their original sizes. [2018-11-07 18:40:12,557 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:13,207 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-07 18:40:13,207 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:13,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:13,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2018-11-07 18:40:13,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:13,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 18:40:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 18:40:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:40:13,209 INFO L87 Difference]: Start difference. First operand 6737 states and 8515 transitions. Second operand 16 states. [2018-11-07 18:40:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:30,224 INFO L93 Difference]: Finished difference Result 13269 states and 16858 transitions. [2018-11-07 18:40:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 18:40:30,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-11-07 18:40:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:30,272 INFO L225 Difference]: With dead ends: 13269 [2018-11-07 18:40:30,272 INFO L226 Difference]: Without dead ends: 7151 [2018-11-07 18:40:30,291 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 183 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-11-07 18:40:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2018-11-07 18:40:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7149. [2018-11-07 18:40:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7149 states. [2018-11-07 18:40:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7149 states to 7149 states and 8952 transitions. [2018-11-07 18:40:30,466 INFO L78 Accepts]: Start accepts. Automaton has 7149 states and 8952 transitions. Word has length 215 [2018-11-07 18:40:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:30,467 INFO L480 AbstractCegarLoop]: Abstraction has 7149 states and 8952 transitions. [2018-11-07 18:40:30,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 18:40:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7149 states and 8952 transitions. [2018-11-07 18:40:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-07 18:40:30,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:30,483 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:30,484 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:30,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1586568926, now seen corresponding path program 1 times [2018-11-07 18:40:30,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:30,485 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:31,026 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 18:40:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 18:40:31,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:31,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:31,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-11-07 18:40:31,223 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:31,226 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:31,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:34,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:40:34,183 INFO L272 AbstractInterpreter]: Visited 123 different actions 1309 times. Merged at 9 different actions 117 times. Widened at 1 different actions 7 times. Found 28 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:40:34,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:34,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:40:34,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:34,190 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:40:34,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:34,201 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:40:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:34,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:40:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:40:34,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:40:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:40:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:40:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-07 18:40:34,598 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:40:34,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 18:40:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 18:40:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:34,599 INFO L87 Difference]: Start difference. First operand 7149 states and 8952 transitions. Second operand 8 states. [2018-11-07 18:40:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:37,413 INFO L93 Difference]: Finished difference Result 14356 states and 18513 transitions. [2018-11-07 18:40:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 18:40:37,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2018-11-07 18:40:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:37,441 INFO L225 Difference]: With dead ends: 14356 [2018-11-07 18:40:37,441 INFO L226 Difference]: Without dead ends: 8238 [2018-11-07 18:40:37,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 463 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-07 18:40:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2018-11-07 18:40:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 7787. [2018-11-07 18:40:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7787 states. [2018-11-07 18:40:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7787 states to 7787 states and 9345 transitions. [2018-11-07 18:40:37,634 INFO L78 Accepts]: Start accepts. Automaton has 7787 states and 9345 transitions. Word has length 227 [2018-11-07 18:40:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:37,635 INFO L480 AbstractCegarLoop]: Abstraction has 7787 states and 9345 transitions. [2018-11-07 18:40:37,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 18:40:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7787 states and 9345 transitions. [2018-11-07 18:40:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-07 18:40:37,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:37,653 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:37,653 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:37,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 395172502, now seen corresponding path program 1 times [2018-11-07 18:40:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:37,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:37,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 200 proven. 61 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 18:40:38,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:38,119 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:38,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-11-07 18:40:38,120 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:38,122 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:38,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:40,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:40:40,001 INFO L272 AbstractInterpreter]: Visited 123 different actions 930 times. Merged at 8 different actions 74 times. Widened at 1 different actions 4 times. Found 14 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:40:40,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:40,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:40:40,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:40,036 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:40:40,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:40,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:40:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:40,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:40:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 18:40:40,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:40:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-07 18:40:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:40:40,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 18:40:40,555 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:40:40,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:40:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:40:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 18:40:40,557 INFO L87 Difference]: Start difference. First operand 7787 states and 9345 transitions. Second operand 12 states. [2018-11-07 18:40:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:45,017 INFO L93 Difference]: Finished difference Result 14453 states and 18779 transitions. [2018-11-07 18:40:45,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 18:40:45,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2018-11-07 18:40:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:45,018 INFO L225 Difference]: With dead ends: 14453 [2018-11-07 18:40:45,018 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:40:45,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=457, Invalid=1895, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 18:40:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:40:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:40:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:40:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:40:45,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2018-11-07 18:40:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:45,058 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:40:45,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:40:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:40:45,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:40:45,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:40:45,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:45,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,268 WARN L179 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 292 [2018-11-07 18:40:46,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:46,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:40:47,313 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 400 DAG size of output: 314 [2018-11-07 18:40:47,584 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-07 18:40:49,217 WARN L179 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2018-11-07 18:40:56,427 WARN L179 SmtUtils]: Spent 7.17 s on a formula simplification. DAG size of input: 353 DAG size of output: 181 [2018-11-07 18:40:58,431 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 316 DAG size of output: 110 [2018-11-07 18:41:00,001 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 338 DAG size of output: 110 [2018-11-07 18:41:00,004 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:41:00,005 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-11-07 18:41:00,005 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:41:00,005 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:41:00,005 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:41:00,005 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,005 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:41:00,006 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,007 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:41:00,008 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:41:00,009 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,010 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:41:00,011 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,012 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:41:00,013 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:41:00,014 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-11-07 18:41:00,015 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:41:00,016 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:41:00,017 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 |old(~a17~0)|)) (.cse5 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a21~0)|)) (.cse18 (< 1 |old(~a17~0)|)) (.cse22 (< |old(~a17~0)| 0)) (.cse11 (< 6 |calculate_output_#in~input|)) (.cse7 (< |calculate_output_#in~input| 2)) (.cse31 (< 5 |calculate_output_#in~input|)) (.cse30 (< |calculate_output_#in~input| 1)) (.cse35 (not (= 0 |old(~a7~0)|))) (.cse37 (not (= 15 |old(~a8~0)|))) (.cse38 (not (= 0 |old(~a17~0)|))) (.cse32 (and (= ~a8~0 15) (= ~a21~0 1))) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a7~0)| ~a7~0) (= ~a16~0 |old(~a16~0)|) (<= |old(~a8~0)| ~a8~0) (= ~a20~0 |old(~a20~0)|))) (.cse41 (< |old(~a8~0)| 14)) (.cse4 (< 0 |old(~a20~0)|)) (.cse36 (not (= 1 |old(~a21~0)|))) (.cse33 (= 1 |old(~a7~0)|)) (.cse42 (not (= 1 |old(~a20~0)|))) (.cse34 (not .cse5)) (.cse2 (not (= 8 ~a12~0))) (.cse43 (= 1 ~a20~0)) (.cse44 (= 13 ~a8~0)) (.cse45 (= |old(~a16~0)| ~a16~0)) (.cse46 (= 1 ~a21~0)) (.cse47 (= 1 ~a17~0)) (.cse48 (not (= 13 |old(~a8~0)|))) (.cse40 (not .cse6))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 (< |old(~a20~0)| 1) .cse6 .cse3) (or (let ((.cse8 (not (= ~v~0 22))) (.cse9 (< |old(~a16~0)| 4)) (.cse10 (not (= ~u~0 21))) (.cse12 (not (= |old(~a21~0)| 1))) (.cse13 (not (= ~b~0 2))) (.cse14 (not (= ~y~0 25))) (.cse15 (not (= |old(~a7~0)| 0))) (.cse16 (not (= 3 ~c~0))) (.cse17 (not (= |old(~a20~0)| 1))) (.cse19 (not (= ~a~0 1))) (.cse20 (< 5 |old(~a16~0)|)) (.cse21 (not (= 26 ~z~0))) (.cse23 (not (= ~x~0 24))) (.cse24 (not (= ~a12~0 8))) (.cse25 (not (= ~e~0 5))) (.cse26 (not (= |old(~a8~0)| 15))) (.cse27 (not (= ~d~0 4))) (.cse28 (not (= 6 ~f~0))) (.cse29 (not (= ~w~0 23)))) (and (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (or .cse8 .cse9 .cse10 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse31 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) .cse32 .cse5) (or .cse33 .cse34 .cse1 .cse2 .cse6) (or .cse11 .cse32 (let ((.cse39 (not (= 5 |old(~a16~0)|)))) (and (or .cse35 .cse36 .cse37 .cse38 (not (= 0 |old(~a20~0)|)) .cse39 .cse2) (or .cse35 .cse36 .cse37 .cse39 .cse2 (< |old(~a20~0)| 0) .cse40))) .cse4 .cse30) (or .cse0 .cse5 .cse41 .cse2 .cse6 .cse1) (or .cse0 .cse33 .cse1 .cse41 .cse2) (or .cse1 (or .cse0 .cse42 .cse2 .cse3)) (or .cse33 .cse41 .cse2 .cse1 .cse4) (or (or .cse35 .cse36 .cse2 .cse18 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse42 .cse37 .cse22 .cse6) .cse32) (or .cse33 .cse1 .cse5 .cse42 .cse2 .cse40) (or .cse34 (and (or .cse11 .cse7) (or .cse31 .cse30)) (or .cse35 .cse36 .cse42 .cse37 .cse38 .cse2) .cse32) (or .cse36 .cse42 .cse34 (and (= 1 ~a7~0) .cse43 .cse44 .cse45 .cse46 .cse47) .cse2 (not .cse33) .cse48 .cse40) (or .cse33 .cse41 .cse2 .cse6 .cse1) (or .cse0 .cse1 .cse41 .cse2 .cse6 .cse4) (or .cse36 .cse33 .cse42 .cse34 .cse2 (and (not (= ~a7~0 1)) .cse43 .cse44 .cse45 .cse46 .cse47) .cse48 .cse40)))) [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,018 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:41:00,019 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,020 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:41:00,021 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,022 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:41:00,023 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:41:00,024 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:41:00,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:41:00,024 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:41:00,024 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:41:00,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:41:00,024 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:41:00,024 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:41:00,025 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 18:41:00,025 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:41:00,025 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:41:00,025 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:41:00,025 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse5 (<= ~a20~0 0)) (.cse3 (<= 14 ~a8~0)) (.cse2 (not (= ~a17~0 1))) (.cse0 (not (= ~a7~0 1))) (.cse6 (not .cse1)) (.cse7 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse9 (= |old(~a20~0)| ~a20~0)) (.cse4 (not (= ~a16~0 6)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse6) (and .cse0 .cse3 .cse5) (and (= 1 ~a20~0) (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse7) (and .cse8 .cse2 (<= 1 ~a20~0) .cse6) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3 .cse4) (not (= 4 ~d~0)) (and .cse8 .cse4 .cse5) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse3 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse9 .cse6 .cse7) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and .cse8 .cse9 .cse4) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 18:41:00,026 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:41:00,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:41:00 BoogieIcfgContainer [2018-11-07 18:41:00,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:41:00,043 INFO L168 Benchmark]: Toolchain (without parser) took 138763.74 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -356.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-07 18:41:00,044 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:41:00,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:00,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.65 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:41:00,046 INFO L168 Benchmark]: Boogie Preprocessor took 187.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:00,047 INFO L168 Benchmark]: RCFGBuilder took 3111.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:00,047 INFO L168 Benchmark]: TraceAbstraction took 134722.57 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 322.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-11-07 18:41:00,052 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 700.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 187.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.9 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3111.26 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.7 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134722.57 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 322.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(a7 == 1) && a16 == 4) && !(a17 == 1)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && !(a16 == 4))) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a21 <= 0 && !(a17 == 1)) && 1 <= a20) && !(a16 == 4))) || !(3 == c)) || !(1 == \old(a21))) || ((!(a7 == 1) && 14 <= a8) && !(a16 == 6))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 14 <= a8) && !(a17 == 1))) || !(21 == u)) || !(22 == v)) || (((!(a7 == 1) && \old(a20) == a20) && !(a16 == 4)) && 1 == a17)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((a21 <= 0 && \old(a20) == a20) && !(a16 == 6))) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 134.6s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 90.8s AutomataDifference, 0.0s DeadEndRemovalTime, 14.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2046 SDtfs, 12104 SDslu, 2543 SDs, 0 SdLazy, 16288 SolverSat, 2268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2499 GetRequests, 2225 SyntacticMatches, 44 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7787occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.1s AbstIntTime, 8 AbstIntIterations, 5 AbstIntStrong, 0.9971236788284303 AbsIntWeakeningRatio, 0.22162162162162163 AbsIntAvgWeakeningVarsNumRemoved, 20.915675675675676 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 360 PreInvPairs, 632 NumberOfFragments, 1457 HoareAnnotationTreeSize, 360 FomulaSimplifications, 23633 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21469 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3704 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 2336/2540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...